László Babai

László Babai is a Hungarian computer scientist and mathematician. He won the Gödel Prize, and he works on the theory of computation, algorithms, combinatorics, and group theory. He gave an algorithm that decides Graph Isomorphism in $\exp((\log n)^{O(1)})$ time. The best time known before that was $\exp(O(\sqrt{n \log n}))$.

Graph Isomorphism asks the following. Two undirected graphs $A = (V_A, E_A)$ and $B = (V_B, E_B)$ are given, where $V_A = \{a_1, a_2, \ldots, a_{n_A}\}$ and $V_B = \{b_1, b_2, \ldots, b_{n_B}\}$. The graphs $A$ and $B$ are isomorphic if and only if both conditions hold.

1. $A$ and $B$ have the same number of vertices and the same number of edges.
2. There is a bijection $f : V_A \to V_B$ such that $\{u, v\} \in E_A$ if and only if $\{f(u), f(v)\} \in E_B$.

In other words, relabeling the vertices of $A$ produces $B$.

Nobody knows whether Graph Isomorphism is in P, and nobody knows whether it is NP-complete. Take the first step of that challenge and decide whether two undirected simple graphs on 3 vertices are isomorphic.

The first line has one integer $T$ ($1 \le T \le 100$), the number of test cases.

Each test case gives two graphs in a row, both in the same format. The description of one graph starts with the number of edges $m$ ($0 \le m \le 3$) of an undirected simple graph on 3 vertices numbered 1 to 3. Then $m$ lines follow, each holding two distinct integers $u$ and $v$ ($u \ne v$, $u, v \in \{1, 2, 3\}$), which means that an edge joins vertex $u$ and vertex $v$. At most one edge joins any pair of vertices.

For each test case, print yes on its own line if the two graphs are isomorphic, and no otherwise.