{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eBob 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$.\u003cbr\u003eFor 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$.\u003cbr\u003eFor 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$.\u003cbr\u003eYou need to help Bob to calculate the minimum energy he needs for the painting with all rules proposed by Alice satisfied.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"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.\u003cbr\u003e\u003cbr\u003eThe 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$.\u003cbr\u003e\u003cbr\u003eThe following one line contains one number $A$($A \\leq 100000$), indicating the first $A$ rules.\u003cbr\u003e\u003cbr\u003eThe following $A$ lines describe the first $A$ rules. Each line contains two numbers $x_i$ and $y_i$ as described above.\u003cbr\u003e\u003cbr\u003eThe following one line contains one number $B$($B \\leq 100000$), indicating the other $B$ rules.\u003cbr\u003e\u003cbr\u003eThe following $B$ lines describe the other $B$ rules. Each line contains two numbers $x_i$ and $y_i$ as described above.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"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.\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 \r\n5\r\n1 2\r\n2 3\r\n3 4\r\n1 5\r\n2\r\n2 1\r\n5 1\r\n1\r\n2 1\r\n5\r\n1 2\r\n2 3\r\n3 4\r\n1 5\r\n3\r\n1 2\r\n2 2\r\n5 1\r\n1\r\n3 5\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n-1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}