#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int de[N], f[N];
vector<int> g[N];
inline void Dfs(int x, int fa) {
    de[x] = de[fa] + 1;
    int tot = 0;
    for (auto y : g[x]) if (y != fa) {
        Dfs(y, x);
        ++tot;
    }
    if (!tot) { f[x] = 1; return; }
    if (de[x] & 1) {
        f[x] = 1e9;
        for (auto y : g[x]) if (y != fa) {
            f[x] = min(f[x], f[y]);
        }
    } else {
        f[x] = 0;
        for (auto y : g[x]) if (y != fa) {
            f[x] += f[y];
        }
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int Case;
    cin >> Case;
    while (Case--) {
        int n;
        cin >> n;
        for (int i = 1, x, y; i < n; ++i) {
            cin >> x >> y;
            g[x].push_back(y);
            g[y].push_back(x);
        }
        Dfs(1, 0);
        printf("%d\n", f[1]);
        for (int i = 1; i <= n; ++i) g[i].clear();
    }
    return 0;

}