#include<bits/stdc++.h>

using namespace std;
const int inf = 1e9 + 1;
const int MOD = 1e9 + 7;

/*
const int N = 1e5 + 5;
int fac[N], inv[N];

int sum(int a, int b) { return (a + b + MOD + MOD) % MOD; }
int mul(int a, int b) { return 1ll * a * b % MOD; }
int Pow(int a, int b) {
    int res = 1;
    for (; b; b>>=1, a = mul(a, a)) if (b&1) {
        res = mul(res, a);
    }
    return res;
}
int C(int n, int k) {
    return mul(fac[n], mul(inv[k], inv[n - k]));
}
void prep() {
    fac[0] = 1;
    for (int i = 1; i < N; i++) fac[i] = mul(fac[i - 1], i);
    inv[N - 1] = Pow(fac[N - 1], MOD - 2);
    for (int i = N - 2; i >= 0; i--) inv[i] = mul(inv[i + 1], i + 1);
}
*/

const int N = 1e5 + 5;
vector<int> g[N];
vector<int> circle;
int mark[N];
int lf[N];

int dfs(int v, int p = 0) {
    mark[v] = 1;
    int ch = 0;
    for (int u : g[v]) if (u != p) {
        if (!mark[u]) {
            ch = max(ch, dfs(u, v));
        } else if (mark[u] == 1) {
            ch = 2;
            circle.push_back(u);
        }
    }
    if (!circle.empty() && v == circle[0]) 
        return 1;
    mark[v] = ch;
    if (mark[v] == 2) {
        circle.push_back(v);
    }
    return mark[v];
}

int count_leaf(int v, int r) {
    mark[v] = 2;
    int leaf = 0;
    for (int u : g[v]) if (mark[u] != 2) {
        leaf += count_leaf(u, r);
    }
    if (leaf == 0 && v != r)
        return 1;
    else
        return leaf;
}
void Solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) g[i].clear(), lf[i] = 0, mark[i] = 0;
    for (int i = 1; i <= n; i++) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    circle.clear();
    dfs(1);
    int sum = 0;
    for (int v : circle) {
        lf[v] = count_leaf(v, v);
        sum += lf[v];
        // cout << v << " " << lf[v] << "\n";
    }
    int ans = max(3, sum);
    for (int i = 0; i < circle.size(); i++) {
        int v = circle[i];
        int u = circle[(i + 1) % circle.size()];
        ans = max(ans, sum - lf[u] - lf[v] + 2);
        ans = max(ans, sum - lf[v] + 1);
    }
    cout << ans << "\n";
}

int main() {
    // prep();
    // cout << C(5, 4) << endl;
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1; cin >> t;
    while (t--) {
        Solve();
    }
}