CF690F2.Tree of Life (medium)

The first line of the input contains $Z<=20$ – the number of test cases. $Z$ descriptions of single test cases follow.

In each test case, the first line of input contains numbers $n$ ( $2<=n<=100$ ) and $k$ (where $k$ is the number of drawings; we have $k=n$ ). In the following lines, the descriptions of the $k$ drawings are given. The description of the $i$ -th drawing is a line containing $m_{i}$ – the number of edges in this drawing, followed by $m_{i}$ lines describing edges, each of which contains two space-separated integers –- the numbers of the two vertices connected by the edge.

If Heidi's drawings cannot possibly come from a single tree, you should output the word NO. Otherwise, output one line containing the word YES and $n-1$ lines describing any tree that Heidi's drawings could have come from. For every edge you should output the numbers of the vertices that it connects, separated with a single space. If there are many solutions, print any of them.

无

In the second sample, there are four lifelines: paths between vertices $1$ and $3$ , $2$ and $4$ , $2$ and $5$ , and $4$ and $5$ .