It is 2500 and John lives in a city consisting of $N$ buildings numbered $1,2,....,N$. The building numbered 1 is John’s school and building numbered $H_1$ is his home. All roads of the city are unidirectional and are given a label $L$ which denotes the road number. There exists $M$ different kinds of label. John wishes to reach his home from his school via some path by travelling on the unidirectional roads.

In a parallel mirror world consisting on $K$ buildings numbered $1,2,...,K$ and there exists a doppelganger of John whose name is Ron. In this parallel world, building $1$ is the school and $H_2$ is his home. Ron is controlled completely by John’s state of mind. Initially both are in school in their respective worlds. Now John starts travelling to his home in the real world. Whenever John takes a path with label $L_i$ from the building where he is at currently, Ron also takes the path with the same label from the building where he is at currently in the mirror world.

Now the condition is that whenever John reaches his home in the real world, only then Ron should also reach his home in the parallel world. Only then we can say it is a mirror world. For some building that they reach simultaneously, if one of them is able to take a path with label $L_i$ but the other isn't able to take the same, then it is not mirror world. Find if this a mirror world or not.

Note that the number of distinct labels are $M$ in both the worlds and there can be at most one path from each building for each label $L_i (1 \leq L_i \leq M)$

INPUT FORMAT

First line contains an integer $T$ denoting the number of test cases.

first line of each test case contains an integer $M$ denoting the number of roads.

the next line contains 3 integers $N, E, H_1$ denoting the number of nodes, number of edges in the first graph and the node number of the home.

Next $E$ lines contain 3 integers $A, B, L_i$ denoting that Ron goes from $A$ to $B$ by road $L_i$.

Next line contains 3 integers $K, F, H_2$ denoting the number of nodes, edges in the second graph, and the node number of the home in second world.

Next $F$ lines contain 3 integers $A, B, L_i$ denoting that Ron goes from $A$ to $B$ by road $L_i$.

OUTPUT FORMAT

For each of the $T$ testcases output a $YES$ or $NO$ in a separate line according to the answer.

CONSTRAINTS

• $1 \leq T \leq 50$

• $1 \leq N, K, M \leq 105$

• $1\le E,F\le 10^4$

• $1\le H1 \le N$

• $1 \le H2 \le K$

SUBTASKS (10 Points)

• $1 \leq T \leq 5$