Given a connected acyclic graph with N nodes and N-1 edges, find out the pair of nodes that are at even distance from each other.

**Input:**

The first line of input contains an integer T denoting the number of test cases.

First line of each test case contains a single integer N denoting the number of nodes in graph.

Second line of each test case contains N-1 pair of nodes xi , yi denoting that there is an edges between them.

**Output:**

For each test case output a single integer denoting the pair of nodes which are at even distance.

**Constraints:**

1<=T<=10

1<=N<=10000

1<=xi,yi<=N

**Example**

**Input**

1

3

1 2 2 3

**Output**

1

**Explanation:**

Only such pair is (1,3) where distance b/w them is 2

Author: pra1nay7_313

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

preparecodinginterview_dot_com | 190 |

hari32147 | 162 |

JonSnow_IKnowNothing | 160 |

AdityaRaj9 | 112 |

shivamsingh00236 | 111 |

abducodes | 906 |

harshtyagi36 | 447 |

arpit_anshuman | 335 |

vamsikrishna55 | 323 |

sandipbhaumik | 321 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.