description: A tree is a connected graph without cycles. A rooted tree has a special vertex called the root. The parent of a vertex v (different from root) is the previous to v vertex on the shortest path from the root to the vertex v. Children of the vertex v are all vertices for which v is the parent.
  
  A vertex is a leaf if it has no children. We call a vertex a bud, if the following three conditions are satisfied: 
  
    * it is not a root, 
    * it has at least one child, and 
    * all its children are leaves. 
  
  
  
  You are given a rooted tree with n vertices. The vertex 1 is the root. In one operation you can choose any bud with all its children (they are leaves) and re-hang them to any other vertex of the tree. By doing that you delete the edge connecting the bud and its parent and add an edge between the bud and the chosen vertex of the tree. The chosen vertex cannot be the bud itself or any of its children. All children of the bud stay connected to the bud.
  
  What is the minimum number of leaves it is possible to get if you can make any number of the above-mentioned operations (possibly zero)?
  
  Input
  
  The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases. Description of the test cases follows.
  
  The first line of each test case contains a single integer n (2 ≤ n ≤ 2 ⋅ 10^5) — the number of the vertices in the given tree.
  
  Each of the next n-1 lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v) meaning that there is an edge between vertices u and v in the tree.
  
  It is guaranteed that the given graph is a tree.
  
  It is guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^5.
  
  Output
  
  For each test case print a single integer — the minimal number of leaves that is possible to get after some operations.
  
  Example
  
  Input
  
  
  5
  7
  1 2
  1 3
  1 4
  2 5
  2 6
  4 7
  6
  1 2
  1 3
  2 4
  2 5
  3 6
  2
  1 2
  7
  7 3
  1 5
  1 3
  4 6
  4 7
  2 1
  6
  2 1
  2 3
  4 5
  3 4
  3 6
  
  
  Output
  
  
  2
  2
  1
  2
  1
  
  Note
  
  In the first test case the tree looks as follows:
  
  <image>
  
  Firstly you can choose a bud vertex 4 and re-hang it to vertex 3. After that you can choose a bud vertex 2 and re-hang it to vertex 7. As a result, you will have the following tree with 2 leaves:
  
  <image>
  
  It can be proved that it is the minimal number of leaves possible to get.
  
  In the second test case the tree looks as follows:
  
  <image>
  
  You can choose a bud vertex 3 and re-hang it to vertex 5. As a result, you will have the following tree with 2 leaves:
  
  <image>
  
  It can be proved that it is the minimal number of leaves possible to get.
solution: import java.io.*;
  import java.util.*;
  
  import static java.lang.Math.*;
  import static java.util.Arrays.*;
  
  public class cf1566e_3 {
  
      public static void main(String[] args) throws IOException {
          int t = ri();
          while (t --> 0) {
              int n = ri(), p[] = new int[n], ccnt[] = new int[n];
              p[0] = -1;
              Graph g = tree(n);
              dfs(g, 0, p, ccnt);
              prln(1 + dfs2(g, 0, p, ccnt));
          }
          close();
      }
  
      static int dfs2(Graph g, int i, int[] p,  int ccnt[]) {
          int ans = 0;
          for (int j : g.get(i)) {
              if (j != p[i]) {
                  ans += dfs2(g, j, p, ccnt);
              }
          }
          if (ccnt[i] != 0) {
              if (p[i] != -1) {
                  --ccnt[p[i]];
              }
              ans += ccnt[i] - 1;
          }
          return ans;
      }
  
      static void dfs(Graph g, int i, int[] p, int ccnt[]) {
          for (int j : g.get(i)) {
              if (j != p[i]) {
                  p[j] = i;
                  ++ccnt[i];
                  dfs(g, j, p, ccnt);
              }
          }
      }
  
      static Graph graph(int n) {
          Graph g = new Graph();
          for (int i = 0; i < n; ++i) {
              g.add(new ArrayList<>());
          }
          return g;
      }
  
      static Graph graph(int n, int m) throws IOException {
          Graph g = graph(n);
          for (int i = 0; i < m; ++i) {
              g.c(rni() - 1, ni() - 1);
          }
          return g;
      }
  
      static Graph digraph(int n, int m) throws IOException {
          Graph g = graph(n);
          for (int i = 0; i < m; ++i) {
              g.cto(rni() - 1, ni() - 1);
          }
          return g;
      }
  
      static Graph tree(int n) throws IOException {
          return graph(n, n - 1);
      }
  
      static Graph graph(List<? extends Collection<Integer>> g) {
          int n = g.size();
          Graph h = graph(n);
          for (int i = 0; i < n; ++i) {
              for (int j : g.get(i)) {
                  h.cto(i, j);
              }
          }
          return h;
      }
  
      static class Graph extends ArrayList<List<Integer>> {
          void cto(int u, int v) {
              get(u).add(v);
          }
  
          void c(int u, int v) {
              cto(u, v);
              cto(v, u);
          }
      }
  
      static BufferedReader __i = new BufferedReader(new InputStreamReader(System.in));
      static PrintWriter __o = new PrintWriter(new OutputStreamWriter(System.out));
      static StringTokenizer input;
      static Random __r = new Random();
  
      // references
      // IBIG = 1e9 + 7
      // IMAX ~= 2e9
      // LMAX ~= 9e18
  
      // constants
      static final int IBIG = 1000000007;
      static final int IMAX = 2147483647;
      static final long LMAX = 9223372036854775807L;
      // math util
      static int minof(int a, int b, int c) {return min(a, min(b, c));}
      static int minof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); int min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
      static long minof(long a, long b, long c) {return min(a, min(b, c));}
      static long minof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); long min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
      static int maxof(int a, int b, int c) {return max(a, max(b, c));}
      static int maxof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); int max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
      static long maxof(long a, long b, long c) {return max(a, max(b, c));}
      static long maxof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); long max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
      static int powi(int a, int b) {if (a == 0) return 0; int ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
      static long powl(long a, int b) {if (a == 0) return 0; long ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
      static int fli(double d) {return (int) d;}
      static int cei(double d) {return (int) ceil(d);}
      static long fll(double d) {return (long) d;}
      static long cel(double d) {return (long) ceil(d);}
      static int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}
      static long gcd(long a, long b) {return b == 0 ? a : gcd(b, a % b);}
      static int[] exgcd(int a, int b) {if (b == 0) return new int[] {1, 0}; int[] y = exgcd(b, a % b); return new int[] {y[1], y[0] - y[1] * (a / b)};}
      static long[] exgcd(long a, long b) {if (b == 0) return new long[] {1, 0}; long[] y = exgcd(b, a % b); return new long[] {y[1], y[0] - y[1] * (a / b)};}
      static int randInt(int min, int max) {return __r.nextInt(max - min + 1) + min;}
      static long mix(long x) {x += 0x9e3779b97f4a7c15L; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9L; x = (x ^ (x >> 27)) * 0x94d049bb133111ebL; return x ^ (x >> 31);}
      // array util
      static void reverse(int[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {int swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(long[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {long swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(double[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {double swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(char[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {char swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void shuffle(int[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); int swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void shuffle(long[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); long swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void shuffle(double[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); double swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void rsort(int[] a) {shuffle(a); sort(a);}
      static void rsort(long[] a) {shuffle(a); sort(a);}
      static void rsort(double[] a) {shuffle(a); sort(a);}
      static int[] copy(int[] a) {int[] ans = new int[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static long[] copy(long[] a) {long[] ans = new long[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static double[] copy(double[] a) {double[] ans = new double[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static char[] copy(char[] a) {char[] ans = new char[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      // input
      static void r() throws IOException {input = new StringTokenizer(rline());}
      static int ri() throws IOException {return Integer.parseInt(rline());}
      static long rl() throws IOException {return Long.parseLong(rline());}
      static double rd() throws IOException {return Double.parseDouble(rline());}
      static int[] ria(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni(); return a;}
      static void ria(int[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = ni();}
      static int[] riam1(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni() - 1; return a;}
      static void riam1(int[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = ni() - 1;}
      static long[] rla(int n) throws IOException {long[] a = new long[n]; r(); for (int i = 0; i < n; ++i) a[i] = nl(); return a;}
      static void rla(long[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = nl();}
      static double[] rda(int n) throws IOException {double[] a = new double[n]; r(); for (int i = 0; i < n; ++i) a[i] = nd(); return a;}
      static void rda(double[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = nd();}
      static char[] rcha() throws IOException {return rline().toCharArray();}
      static void rcha(char[] a) throws IOException {int n = a.length, i = 0; for (char c : rline().toCharArray()) a[i++] = c;}
      static String rline() throws IOException {return __i.readLine();}
      static String n() {return input.nextToken();}
      static int rni() throws IOException {r(); return ni();}
      static int ni() {return Integer.parseInt(n());}
      static long rnl() throws IOException {r(); return nl();}
      static long nl() {return Long.parseLong(n());}
      static double rnd() throws IOException {r(); return nd();}
      static double nd() {return Double.parseDouble(n());}
      // output
      static void pr(int i) {__o.print(i);}
      static void prln(int i) {__o.println(i);}
      static void pr(long l) {__o.print(l);}
      static void prln(long l) {__o.println(l);}
      static void pr(double d) {__o.print(d);}
      static void prln(double d) {__o.println(d);}
      static void pr(char c) {__o.print(c);}
      static void prln(char c) {__o.println(c);}
      static void pr(char[] s) {__o.print(new String(s));}
      static void prln(char[] s) {__o.println(new String(s));}
      static void pr(String s) {__o.print(s);}
      static void prln(String s) {__o.println(s);}
      static void pr(Object o) {__o.print(o);}
      static void prln(Object o) {__o.println(o);}
      static void prln() {__o.println();}
      static void pryes() {prln("yes");}
      static void pry() {prln("Yes");}
      static void prY() {prln("YES");}
      static void prno() {prln("no");}
      static void prn() {prln("No");}
      static void prN() {prln("NO");}
      static boolean pryesno(boolean b) {prln(b ? "yes" : "no"); return b;};
      static boolean pryn(boolean b) {prln(b ? "Yes" : "No"); return b;}
      static boolean prYN(boolean b) {prln(b ? "YES" : "NO"); return b;}
      static void prln(int... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static void prln(long... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static void prln(double... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static <T> void prln(Collection<T> c) {int n = c.size() - 1; Iterator<T> iter = c.iterator(); for (int i = 0; i < n; pr(iter.next()), pr(' '), ++i); if (n >= 0) prln(iter.next()); else prln();}
      static void h() {prln("hlfd"); flush();}
      static void flush() {__o.flush();}
      static void close() {__o.close();}
  }