#include <bits/stdc++.h>

using namespace std;
using LL=long long;
const LL mod=998244353;

LL qpow(LL a,LL n)
{
	LL ans=1;
	while (n){
		if (n&1) ans=ans*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return ans;
}

int main()
{
	cin.tie(0)->sync_with_stdio(false);
	int _=1;
	cin>>_;
	while (_--){
		int n;
		cin>>n;
		vector <int> v[n+10];
		for (int i=1;i<n;i++){
			int x,y;
			cin>>x>>y;
			v[x].push_back(y);
			v[y].push_back(x);
		}
		
		vector <LL> siz(n+10,0),sum(n+10,0);
		LL ans=0;
		function<void(int,int)> dfs=[&](int d,int fa)
		{
//			cout<<d<<" ";
			siz[d]=1;
			LL fin=0,pin=0;
			for (auto p:v[d]){
				if (p==fa) continue;
				dfs(p,d);
				siz[d]+=siz[p];
				sum[d]=(sum[d]+siz[p]*siz[p])%mod;
				ans=(ans+siz[p]*siz[p]%mod*(n-siz[p])*(n-siz[p])%mod)%mod;
				fin=(fin+sum[p])%mod;
				pin=(pin+sum[p]*sum[p])%mod;
				ans=(ans+2*((n-siz[p])*(n-siz[p])%mod*(sum[p]-(siz[p]*siz[p])%mod+mod)%mod)%mod)%mod;
			}
			sum[d]=(sum[d]+siz[d]*siz[d])%mod;
			ans=((ans+fin*fin%mod)%mod-pin+mod)%mod;
		};
		
		dfs(1,0);
//		for (int i=1;i<=n;i++) cout<<siz[i]<<" "<<sum[i]<<'\n';
		LL fm=n%mod*n%mod*(n-1)%mod*(n-1)%mod*qpow(4,mod-2)%mod;
		ans=ans*qpow(fm,mod-2)%mod;
		cout<<ans<<'\n';
	}
}