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

const int N = 5e5 + 200;

int n, dp[3][N];
vector<int> g[N];

void dfs(int v, int p = -1) {
    dp[0][v] = dp[1][v] = dp[2][v] = 0;
    for (int u : g[v]) {
        if (u == p) continue;
        dfs(u, v);
        dp[0][v] += max({dp[0][u], dp[1][u], dp[2][u]});
        dp[1][v] += dp[0][u];
    }
    dp[1][v]++;
    for (int u : g[v]) {
        if (u == p) continue;
        dp[2][v] = max(dp[2][v], dp[1][v] - dp[0][u] + dp[1][u]);
    }
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) g[i].clear();
    for (int i = 1, v, u; i < n; ++i) {
        cin >> v >> u;
        g[v].push_back(u);
        g[u].push_back(v);
    }
    dfs(1);
    cout << max({dp[0][1], dp[1][1], dp[2][1]}) << '\n';
}

int main() {
    int size (512 << 20); // 512 M
    __asm__ ( "movq %0, %%rsp\n"::"r"((char*)malloc(size)+size));
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    exit (0);
}