#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#define I inline
using namespace std;

const int N = 100010;
int siz[N],vis[N],cir[N],pre[N],inc[N],ccnt;
int n,flag;
vector<int> q[N];

void dfs1(int x,int fa) {
	pre[x]=fa; vis[x]=1;
	for(auto &t:q[x] ) {
		if(flag) return ;
		if(t==fa) continue;
		if(vis[t]) {
			int mk=x; flag=1;
			while(1) {
			//	cout<<mk<<' '<<pre[mk]<<endl;
				cir[++ccnt]=mk;
				inc[mk]=1;
				if(mk==t) break;
				mk=pre[mk];
			}
			return ;
		}
		dfs1(t,x);
	}
}
void dfs2(int x,int fa) { //cout<<x<<endl;
	if(q[x].size()==1) {
		siz[x]=1;
		return ;
	}
	for(auto &t:q[x]) {
		if(t==fa||inc[t]) continue;
		dfs2(t,x);
		siz[x]+=siz[t];
	}
}
I void clear() {
	ccnt=flag=0;
	for(int i=1;i<=n;++i) {
		q[i].clear();
		siz[i]=vis[i]=cir[i]=pre[i]=inc[i]=0;
	}
}
I void check1() {
	cout<<ccnt<<endl;
	for(int i=1;i<=ccnt;++i) cout<<cir[i]<<' '; cout<<endl;
}
I int read() {
	int ret=0,w=1; char ch;
	while((ch=getchar())>'9'||ch<'0'&&ch!='-'); if(ch=='-') w=-1; else ret=ch-'0';
	while((ch=getchar())>='0'&&ch<='9') ret=ret*10+ch-'0';
	return ret*w; 
}
int main()
{
	int T; cin>>T;
	while(T--) {
		n=read(); clear();
		for(int i=1;i<=n;++i) {
			int x,y; x=read(); y=read();
			q[x].push_back(y);
			q[y].push_back(x);
		}		
		dfs1(1,0);
	//	cout<<"waao"<<endl;
	//	check1();
		for(int i=1;i<=ccnt;++i) dfs2(cir[i],0);
		int sum=0,ans=3;
		for(int i=1;i<=ccnt;++i) sum+=siz[cir[i]];
		for(int i=1;i<=ccnt;++i) ans=max(ans,sum-siz[i]+1);
		for(int i=1;i<=ccnt;++i) {
			int l=cir[i],r=cir[i%ccnt+1];
			ans=max(ans,sum-siz[l]-siz[r]+2);
		}
		cout<<ans<<endl;
	}
	
 }