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.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.util.Arrays;
  import java.util.Deque;
  import java.util.ArrayList;
  import java.io.OutputStream;
  import java.io.PrintStream;
  import java.util.Collection;
  import java.io.IOException;
  import java.lang.reflect.Field;
  import java.nio.charset.StandardCharsets;
  import java.io.UncheckedIOException;
  import java.util.List;
  import java.io.Closeable;
  import java.util.ArrayDeque;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   */
  public class Main {
      public static void main(String[] args) throws Exception {
          Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 29);
          thread.start();
          thread.join();
      }
  
      static class TaskAdapter implements Runnable {
          @Override
          public void run() {
              InputStream inputStream = System.in;
              OutputStream outputStream = System.out;
              FastInput in = new FastInput(inputStream);
              FastOutput out = new FastOutput(outputStream);
              EBudsReHanging solver = new EBudsReHanging();
              int testCount = Integer.parseInt(in.next());
              for (int i = 1; i <= testCount; i++)
                  solver.solve(i, in, out);
              out.close();
          }
      }
  
      static class EBudsReHanging {
          Debug debug = new Debug(false);
  
          public void solve(int testNumber, FastInput in, FastOutput out) {
              int n = in.ri();
              Node[] nodes = new Node[n];
              for (int i = 0; i < n; i++) {
                  nodes[i] = new Node();
                  nodes[i].id = i;
              }
              for (int i = 0; i < n - 1; i++) {
                  Node a = nodes[in.ri() - 1];
                  Node b = nodes[in.ri() - 1];
                  a.adj.add(b);
                  b.adj.add(a);
              }
              dfs(nodes[0], null);
              for (int i = 0; i < n; i++) {
                  nodes[i].nonLeaf = nodes[i].deg = nodes[i].adj.size();
                  nodes[i].leaf = nodes[i].deg == 0;
              }
              Deque<Node> dq = new ArrayDeque<>(n);
              for (Node node : nodes) {
                  if (node.leaf && node.parent != null) {
                      node.parent.nonLeaf--;
                      if (node.parent.nonLeaf == 0) {
                          node.parent.bud = true;
                          assert node.parent.check();
                          dq.addLast(node.parent);
                      }
                  }
              }
              while (!dq.isEmpty()) {
                  Node head = dq.removeFirst();
                  debug.debug("head", head);
                  if (head.parent == null) {
                      continue;
                  }
                  head.parent.nonLeaf--;
                  head.parent.deg--;
                  if (head.parent.deg == 0) {
                      head.parent.leaf = true;
                      assert head.parent.check();
                      if (head.parent.parent != null) {
                          head.parent.parent.nonLeaf--;
                          if (head.parent.parent.nonLeaf == 0) {
                              head.parent.parent.bud = true;
                              assert head.parent.parent.check();
                              dq.addLast(head.parent.parent);
                          }
                      }
                  } else if (head.parent.nonLeaf == 0) {
                      head.parent.bud = true;
                      assert head.parent.check();
                      dq.addLast(head.parent);
                  }
              }
  
              int numBud = 0;
              int numLeaf = 0;
              for (Node node : nodes) {
                  assert node.check();
                  if (node.leaf) {
                      numLeaf++;
                  }
                  if (node.bud) {
                      numBud++;
                  }
              }
              if (nodes[0].leaf) {
                  numLeaf--;
              }
              out.println(numLeaf - numBud + 1);
          }
  
          public void dfs(Node root, Node p) {
              root.adj.remove(p);
              root.parent = p;
              for (Node node : root.adj) {
                  dfs(node, root);
              }
          }
  
      }
  
      static class FastInput {
          private final InputStream is;
          private StringBuilder defaultStringBuf = new StringBuilder(1 << 13);
          private byte[] buf = new byte[1 << 13];
          private int bufLen;
          private int bufOffset;
          private int next;
  
          public FastInput(InputStream is) {
              this.is = is;
          }
  
          private int read() {
              while (bufLen == bufOffset) {
                  bufOffset = 0;
                  try {
                      bufLen = is.read(buf);
                  } catch (IOException e) {
                      bufLen = -1;
                  }
                  if (bufLen == -1) {
                      return -1;
                  }
              }
              return buf[bufOffset++];
          }
  
          public void skipBlank() {
              while (next >= 0 && next <= 32) {
                  next = read();
              }
          }
  
          public String next() {
              return readString();
          }
  
          public int ri() {
              return readInt();
          }
  
          public int readInt() {
              boolean rev = false;
  
              skipBlank();
              if (next == '+' || next == '-') {
                  rev = next == '-';
                  next = read();
              }
  
              int val = 0;
              while (next >= '0' && next <= '9') {
                  val = val * 10 - next + '0';
                  next = read();
              }
  
              return rev ? val : -val;
          }
  
          public String readString(StringBuilder builder) {
              skipBlank();
  
              while (next > 32) {
                  builder.append((char) next);
                  next = read();
              }
  
              return builder.toString();
          }
  
          public String readString() {
              defaultStringBuf.setLength(0);
              return readString(defaultStringBuf);
          }
  
      }
  
      static class Debug {
          private boolean offline;
          private PrintStream out = System.err;
          static int[] empty = new int[0];
  
          public Debug(boolean enable) {
              offline = enable && System.getSecurityManager() == null;
          }
  
          public Debug debug(String name, Object x) {
              return debug(name, x, empty);
          }
  
          public Debug debug(String name, Object x, int... indexes) {
              if (offline) {
                  if (x == null || !x.getClass().isArray()) {
                      out.append(name);
                      for (int i : indexes) {
                          out.printf("[%d]", i);
                      }
                      out.append("=").append("" + x);
                      out.println();
                  } else {
                      indexes = Arrays.copyOf(indexes, indexes.length + 1);
                      if (x instanceof byte[]) {
                          byte[] arr = (byte[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof short[]) {
                          short[] arr = (short[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof boolean[]) {
                          boolean[] arr = (boolean[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof char[]) {
                          char[] arr = (char[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof int[]) {
                          int[] arr = (int[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof float[]) {
                          float[] arr = (float[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof double[]) {
                          double[] arr = (double[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else if (x instanceof long[]) {
                          long[] arr = (long[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      } else {
                          Object[] arr = (Object[]) x;
                          for (int i = 0; i < arr.length; i++) {
                              indexes[indexes.length - 1] = i;
                              debug(name, arr[i], indexes);
                          }
                      }
                  }
              }
              return this;
          }
  
      }
  
      static class FastOutput implements AutoCloseable, Closeable, Appendable {
          private static final int THRESHOLD = 32 << 10;
          private OutputStream writer;
          private StringBuilder cache = new StringBuilder(THRESHOLD * 2);
          private static Field stringBuilderValueField;
          private char[] charBuf = new char[THRESHOLD * 2];
          private byte[] byteBuf = new byte[THRESHOLD * 2];
  
          static {
              try {
                  stringBuilderValueField = StringBuilder.class.getSuperclass().getDeclaredField("value");
                  stringBuilderValueField.setAccessible(true);
              } catch (Exception e) {
                  stringBuilderValueField = null;
              }
              stringBuilderValueField = null;
          }
  
          public FastOutput append(CharSequence csq) {
              cache.append(csq);
              return this;
          }
  
          public FastOutput append(CharSequence csq, int start, int end) {
              cache.append(csq, start, end);
              return this;
          }
  
          private void afterWrite() {
              if (cache.length() < THRESHOLD) {
                  return;
              }
              flush();
          }
  
          public FastOutput(OutputStream writer) {
              this.writer = writer;
          }
  
          public FastOutput append(char c) {
              cache.append(c);
              afterWrite();
              return this;
          }
  
          public FastOutput append(int c) {
              cache.append(c);
              afterWrite();
              return this;
          }
  
          public FastOutput println(int c) {
              return append(c).println();
          }
  
          public FastOutput println() {
              return append('\n');
          }
  
          public FastOutput flush() {
              try {
                  if (stringBuilderValueField != null) {
                      try {
                          byte[] value = (byte[]) stringBuilderValueField.get(cache);
                          writer.write(value, 0, cache.length());
                      } catch (Exception e) {
                          stringBuilderValueField = null;
                      }
                  }
                  if (stringBuilderValueField == null) {
                      int n = cache.length();
                      if (n > byteBuf.length) {
                          //slow
                          writer.write(cache.toString().getBytes(StandardCharsets.UTF_8));
  //                writer.append(cache);
                      } else {
                          cache.getChars(0, n, charBuf, 0);
                          for (int i = 0; i < n; i++) {
                              byteBuf[i] = (byte) charBuf[i];
                          }
                          writer.write(byteBuf, 0, n);
                      }
                  }
                  writer.flush();
                  cache.setLength(0);
              } catch (IOException e) {
                  throw new UncheckedIOException(e);
              }
              return this;
          }
  
          public void close() {
              flush();
              try {
                  writer.close();
              } catch (IOException e) {
                  throw new UncheckedIOException(e);
              }
          }
  
          public String toString() {
              return cache.toString();
          }
  
      }
  
      static class Node {
          List<Node> adj = new ArrayList<>();
          Node parent;
          int deg;
          int nonLeaf;
          boolean leaf;
          boolean bud;
          int id;
  
          public String toString() {
              return "" + (id + 1);
          }
  
          public boolean check() {
              return !(leaf && bud);
          }
  
      }
  }
  
  