B"You are given a tree ^{ dagger} . In one zelda-operation you can do follows: Determine the minimum number of zelda-operations required for the tree to have only one vertex. ^{ dagger} A tree is a connected acyclic undirected graph. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer n ( 2 <= n <= 10^5 ) -- the number of vertices. i -th of the next n xe2 x88 x92 1 lines contains two integers u_i and v_i ( 1 <= u_i, v_i <= n, u_i ne v_i ) -- the numbers of vertices connected by the i -th edge. 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 10^5 . For each test case, output a single integer -- the minimum number of zelda-operations required for the tree to have only one vertex. In the first test case, it's enough to perform one zelda-operation for vertices 2 and 4 . In the second test case, we can perform the following zelda-operations: "...