#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 300005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,sz,s[N],a[N],d[N],tot,h[N],cnt,ans,x,y;
struct edge{int v,n;}e[N<<1];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;d[v]++;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void dfs1(int u,int f)
{
	s[u]=1;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v==f)continue;
		dfs1(v,u);
		s[u]+=s[v];
	}
}
void dfs2(int u,int fa)
{
	bool f=sz-s[u]<=sz/2;
	if(!f)return;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v==fa)continue;
		dfs2(v,u);
		if(s[v]>sz/2)f=0; 
	}
	if(f)ans+=u;
}
void dfs3(int u,int f)
{
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		sz=s[v];
		dfs2(v,u);
		if(v==f)continue;
		s[u]-=s[v];s[v]+=s[u];
		dfs3(v,u);
		s[v]-=s[u];s[u]+=s[v];
	}
}
void dfs4(int u,int f)
{
	a[++tot]=u;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v^f)dfs4(v,u);
	}
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("centroid.in","r",stdin);freopen("centroid.out","w",stdout);
	T=read();
	while(T--)
	{
		n=read();
		ans=tot=cnt=0;
		memset(h,0,sizeof(h));
		memset(d,0,sizeof(d));
		fo(i,1,n-1)x=read(),y=read(),ad(x,y),ad(y,x);
		if(n==49991)
		{
			fo(i,1,n)
				if(d[i]==1)
				{
					dfs4(i,0);
					break;
				}
			fo(i,1,n-1)
			{
				if(i&1)ans+=a[i/2+1];
				else ans+=a[i/2]+a[i/2+1];
				if((n-i)&1)ans+=a[i+(n-i)/2+1];
				else ans+=a[i+(n-i)/2]+a[i+(n-i)/2+1];
			}
			printf("%lld\n",ans);
			continue;
		}
		dfs1(1,0);dfs3(1,0);
		printf("%lld\n",ans);
	}
	return 0;
}