B'Copil Copac is given a list of n-1 edges describing a tree of n vertices. He decides to draw it using the following algorithm: The number of readings is defined as the number of times Copil Copac performs step 1 . Find the number of readings needed by Copil Copac to draw the tree. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains a single integer n ( 2 <= n <= 2 cdot 10^5 ) -- the number of vertices of the tree. The following n - 1 lines of each test case contain two integers u_i and v_i ( 1 <= u_i, v_i <= n , u_i neq v_i ) -- indicating that (u_i,v_i) is the i -th edge in the list. It is guaranteed that the given edges form a tree. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output the number of readings Copil Copac needs to draw the tree. In the first test case: After the first reading, the tree will look like this: After the second reading: Therefore, Copil Copac needs 2 readings to draw the tree. '...