#include <bits/stdc++.h>
using namespace std;
static constexpr int maxn = 500000 + 5;

vector<int> g[maxn];
int dp[maxn][3];

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

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
        for (int i = 1; i < n; ++i) {
            int u, v; cin >> u >> v;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        dfs(1, 1);
        cout << max({dp[1][0], dp[1][1], dp[1][2]}) << '\n';
        for (int i = 1; i <= n; ++i)
            g[i].clear();
    }
    return 0;
}