#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int M = 101010;

int n;
vector<int> g[M];

int par[M], ln[M], dn;
bool bad[M];
vector<int> cyc;

void dfs(int p, int v) {
    ln[v] = ++dn;
    for (int x : g[v]) {
        if (p == x) continue;
        if (!ln[x]) {
            par[x] = v;
            dfs(v, x);
        }
        else if (ln[x] < ln[v]) {
            for (int y = v; y != x; y = par[y]) 
                bad[y] = 1, cyc.push_back(y);
            cyc.push_back(x);
            bad[x] = 1;
        }
    }
}

int dp[M];
void dfs2(int p, int v) {
    dp[v] = 0;
    for (int x : g[v]) if (p != x && !bad[x]) {
        dfs2(v, x);
        dp[v] += dp[x];
    }
    if (p != v)
        dp[v] = max(dp[v], 1);
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    int t; cin >> t;
    while (t--) {
        cin >> n;
        for (int i = 0; i < n; i++) {
            int u, v; cin >> u >> v;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        dfs(0, 1);

        int ans = 3;
        int sum = 0;
        vector<int> v;
        for (int x : cyc) {
            dfs2(x, x);
            sum += dp[x];
            v.push_back(dp[x]);
        }

        ans = max(ans, sum);
        int sz = v.size();
        for (int i = 0; i < sz; i++)
            ans = max(ans, 1 + sum - v[i]);
        
        for (int i = 0; i < sz; i++)
            ans = max(ans, 2 + sum - v[i] - v[(i + 1) % sz]);

        cout << ans << '\n';

        dn = 0;
        for (int i = 1; i <= n; i++) {
            g[i].clear();
            par[i] = 0;
            bad[i] = 0;
            ln[i] = 0;
            dp[i] = 0;
        }
        cyc.clear();
    }
}