#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}

const int maxn=222222;
const int mod=998244353;
int N,fir[maxn],nxt[maxn],to[maxn],tot;
ll siz[maxn],f1[maxn],f2[maxn],f3[maxn],ANS;

void add_edge(int x,int y)
{
	nxt[++tot]=fir[x],to[fir[x]=tot]=y;
}

void dfs(int x,int y)
{
	ll tmp1=0,tmp2=0,tmp3=0,tmp4=0,tmp5=0,tmp6=0;
	ll tot1=0,tot4=0,tot6=0;
	ll sizb2=0;
	siz[x]=1;
	for(int i=fir[x],v=to[i];i;i=nxt[i],v=to[i])if(v!=y)
	{
		dfs(v,x);
		sizb2+=siz[v]*siz[v];
		sizb2%=mod;
		siz[x]+=siz[v];
		f3[x]-=siz[v]*siz[v];
		f3[x]%=mod;
		tot1+=f3[v];
		tot1%=mod;
		tot4+=f1[v]+2*f2[v]+f3[v];
		tot4%=mod;
		tot6+=f2[v]+f3[v];
		tot6%=mod;
	}
	f1[x]=tot4;
	f2[x]=tot6;
	f3[x]+=tot1+2*siz[x]-1+(siz[x]-1)*(siz[x]-1);
	f3[x]%=mod;
	sizb2+=(N-siz[x])*(N-siz[x]);
	sizb2%=mod;
	for(int i=fir[x],v=to[i];i;i=nxt[i],v=to[i])if(v!=y)
	{
		tmp1=(tot1-f3[v])%mod;
		tmp2=(f1[v]+2*f2[v]+f3[v])%mod;
		tmp3=f3[v];
		tmp4=(tot4-(f1[v]+2*f2[v]+f3[v]))%mod;
		tmp5=(f2[v]+f3[v])%mod;
		tmp6=(tot6-(f2[v]+f3[v]))%mod;
		tot1=tmp1,tot4=tmp4,tot6=tmp6;
		ll tmp=N-siz[v];
		ANS+=(tmp*2-1+(tmp-1)*(N-1-siz[v])%mod-sizb2+siz[v]*siz[v]%mod)%mod*tmp2%mod;
		// cout<<"ANS"<<x<<':'<<ANS<<endl;
		ANS+=tmp1*tmp2%mod+tmp3*tmp4%mod+2*tmp5*tmp6%mod;
		// cout<<"ANS"<<x<<':'<<ANS<<endl;
		ANS%=mod;
	}
	// cout<<"ANS"<<x<<':'<<ANS<<endl;
	// cout<<"f"<<x<<':'<<f1[x]<<' '<<f2[x]<<' '<<f3[x]<<' '<<endl;
}

ll mul(ll x,int k)
{
	ll ans=1,mid=x;
	while(k)
	{
		if(k&1) ans=ans*mid%mod;
		mid=mid*mid%mod;
		k>>=1;
	}
	return ans;
}

int main()
{
	int T=read();
	while(T--)
	{
		N=read();
		tot=ANS=0;
		for(int i=0;i<=N+5;++i) fir[i]=siz[i]=f1[i]=f2[i]=f3[i]=0;
		for(int i=1;i<N;++i) 
		{
			int a=read(),b=read();
			add_edge(a,b),add_edge(b,a);
		}
		dfs(1,0);
		ANS=(ANS%mod+mod)%mod;
		// cout<<ANS<<endl;
		// for(ll i=1;i<=200;++i)if(i*4%mod*mul(N*N%mod*(N-1)%mod*(N-1)%mod,mod-2)%mod==918384806) cout<<i<<endl;
		cout<<ANS*4%mod*mul(N*N%mod*(N-1)%mod*(N-1)%mod,mod-2)%mod<<'\n';
	}
	return 0;
}