#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 1e5 + 5;

std::vector<int> G[MAXN];
int n,fa[MAXN];
bool vis[MAXN],ins[MAXN];
std::vector<int> cir;

inline void dfs(int v){
    vis[v] = 1;ins[v] = 1;
    for(auto x:G[v]){
        if(x == fa[v]) continue;
        if(!vis[x]){
            fa[x] = v;dfs(x);
        }
        else if(ins[x]){
            int t = v;
            while(t != x){
                cir.pb(t);
                t = fa[t];
            }
            cir.pb(t);
        }
    }
    ins[v] = 0;
}

inline void Solve(){
    scanf("%d",&n);FOR(i,1,n) G[i].clear(),fa[i] = vis[i] = 0;
    FOR(i,1,n){
        int u,v;scanf("%d%d",&u,&v);
        G[u].pb(v);G[v].pb(u);
    }
    cir.clear();dfs(1);
    int sm = 0;FOR(i,1,n) sm += (SZ(G[i]) == 1);
    std::vector<int> tmp;
    for(auto &x:cir) x = (SZ(G[x]) == 2);
    int ps = -1,mx = 0;
    FOR(i,0,SZ(cir)-1) if(!cir[i]){ps = i;break;}
    if(ps == -1) mx = SZ(cir);
    else{
        int cnt = 0;
        FOR(i,0,ps-1) cir.pb(cir[i]);
        FOR(i,ps,SZ(cir)-1){
            if(!cir[i]){
                mx = std::max(mx,cnt);
                cnt = 0;
            }
            else ++cnt;
        }
        mx = std::max(mx,cnt);
    }
    printf("%d\n",std::max(3,sm+std::min(2,mx)));
}

int main(){
    int T;scanf("%d",&T);
    while(T--) Solve();
    return 0;
}