Find Center of Star Graph

You have been given an undirected star graph in the form of Adjacency List 'EDGES', consisting of ‘N’ nodes labelled from 1 to ‘N’. A star graph is a graph where there is one centre node and exactly ‘N’ - 1 edges that connect the centre node to every other node.

You are given a matrix ‘EDGES’ storing the information about the edges, where each row, ‘EDGES[i]’ contains two integers ‘U’ and ‘V’, which implies that there is an undirected edge between ‘U’ and ‘V’.

For Example :

For the given graph:

Node 1 is connected to all other nodes. Hence node 1 is the centre of this star graph.

Input Format :

The first line contains an integer 'T' which denotes the number of test cases.

The first line of each test case contains ‘M’, no of edges.

The following ‘M’ lines contain two integers ‘U’ and ‘V’ denoting there is an undirected edge between node ‘U’ and node ‘V’.

Output Format :

For each test case, return the centre of the given star graph.

The first and only line of output of each test case prints the centre of a given star graph.

Note :

You don't need to print anything, it has already been taken care of. Just implement the given function.

Constraints :

1 ≤ T ≤ 10
3 ≤ M ≤ 10^4
M is always equal to N - 1
EDGES.length = M
1 ≤ U, V ≤ N

Time limit: 1 sec