Squaring the Triangle

Wesley creates a graph $G$ with $N$ vertices. For each pair of vertices $\{u, v\}$, an edge exists between $u$ and $v$ with probability $\dfrac{p}{q}$. The probabilities are independent of each other.

Let $∆(G)$ denote the number of triangles in $G$. A triangle is a set of 3 vertices connected by 3 edges.

Find the expected value of $(∆(G))^2$.

The first line contains an integer $T$ ($1 \le T \le 10^6$), the number of cases. The next $T$ lines each contain integers $N$, $p$, $q$ ($3 \le N \le 10^6$, $1 \le p < q \le 10^6$), separated by spaces.

Output $T$ lines, one for each case. If the expected value for a case is $\dfrac{P}{Q}$ in lowest terms, output $PQ^{-1} \bmod (10^9 + 7)$. That is, output an integer $R$ with $0 \le R < 10^9 + 7$ such that $P \equiv RQ \pmod{10^9 + 7}$.