#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define N 500007

vector<int> e[N];

int f[N][3];

// f[u][0] : not choose u
// f[u][1] : choose u, not choose u's son
// f[u][2] : choose u, choose u's son

void dfs(int u, int fa) {
    int dlt = 0;
    f[u][0] = 0;
    f[u][1] = 1;
    f[u][2] = 1;
    for (auto v : e[u]) 
        if (v != fa) {
            dfs(v, u);
            f[u][0] += max({f[v][0], f[v][1], f[v][2]});
            f[u][1] += f[v][0];
            dlt = max(dlt, f[v][1] - f[v][0]);
        }
    f[u][2] = f[u][1] + dlt;
}

inline void work() {
    int n = rd();
    for (int i = 1; i <= n; ++i) e[i].clear();
    for (int i = 1; i < n; ++i) {
        int u = rd(), v = rd();
        e[u].pb(v); e[v].pb(u);
    }
    dfs(1, 1);
    printf("%d\n", max({f[1][0], f[1][1], f[1][2]}));
}

int main() {
    for (int t = rd(); t; --t) work();
    exit(0);
}