Anti-Plagiarism

As homework, a teacher asked every student in an art class to draw a beautiful and, above all, original tree. After the submissions, she began to suspect some students of cheating. The teacher considers a tree $T_1$ to be copied from a tree $T_2$ if it is possible to add some (possibly zero) vertices and edges to $T_2$ and relabel its vertices so that it becomes the same as $T_1$. She suspects $t$ pairs of students. For each pair of trees, check whether the first tree could be copied from the second tree.

The first line contains an integer $t$ ($1 \le t \le 10^4$), the number of suspicious pairs. Each description of a pair begins with an integer $n$ ($2 \le n \le 10^5$). The next $n-1$ lines each contain two integers $u$ and $v$ ($1 \le u, v \le n$), the edges of the first student's tree. The next line contains an integer $m$ ($2 \le m \le n$). The next $m-1$ lines each contain two integers $u$ and $v$ ($1 \le u, v \le m$), the edges of the second student's tree. The sum of $n$ over all pairs does not exceed $5 \cdot 10^5$, and the sum of $n \cdot m$ does not exceed $10^7$.

For each pair, print a line containing a single word, "Yes" if the first tree could be copied from the second tree, or "No" otherwise. The word is case-insensitive.