Color a Tree

Bob intends to color the nodes of a tree with a pen. The tree consists of $N$ nodes. These nodes are numbered $1, 2, ..., N$. The root of the tree is node $1$. The initial color of each node is white. Bob can use one unit energy to color one node into black. To prevent Bob being lazy with painting, Alice proposed $A + B$ rules. Each rule is represent by two numbers $x_i$ and $y_i$.
For the first $A$ rules, it means that there should be no less than $y_i$ nodes painted black for the subtree of node $x_i$.
For the other $B$ rules, it means that there should be no less than $y_i$ nodes painted black for all nodes except the subtree of node $x_i$.
You need to help Bob to calculate the minimum energy he needs for the painting with all rules proposed by Alice satisfied.

The first line is the number of test cases. For each test case, the first line contains one positive number $N(1 \leq N \leq 100000)$, indicating the number of trees nodes.

The following $N - 1$ lines describe the edges. Each line contains two integers $u, v$($1 \leq u, v \leq N$), denoting there is a edge between node $u$ and node $v$.

The following one line contains one number $A$($A \leq 100000$), indicating the first $A$ rules.

The following $A$ lines describe the first $A$ rules. Each line contains two numbers $x_i$ and $y_i$ as described above.

The following one line contains one number $B$($B \leq 100000$), indicating the other $B$ rules.

The following $B$ lines describe the other $B$ rules. Each line contains two numbers $x_i$ and $y_i$ as described above.

For each test case, output a integer donating the minimum energy Bob needs to use with all rules propose by Alice satisfied. If there is no solution, output $-1$ instead.

2 
5
1 2
2 3
3 4
1 5
2
2 1
5 1
1
2 1
5
1 2
2 3
3 4
1 5
3
1 2
2 2
5 1
1
3 5

2
-1

2017 ACM/ICPC 哈尔滨赛区网络赛——测试专用