#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (ll)a.size()
#define lb(x) (x&-x)
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
using namespace std;
using ll=long long;
using ull=unsigned long long;
using db=double;
using pll=pair<ll,ll>;
//using i128=__int128;
template<typename T> constexpr bool cmax(T &a,const T &b){return b>a?a=b,1:0;}
template<typename T> constexpr bool cmin(T &a,const T &b){return b<a?a=b,1:0;}
constexpr ll N=100010;
constexpr ll mod=998244353;
ll n,ans,sz[N],fa[N],s[N];
vector<ll> T[N];
ll sq(ll x){
	return x*x%mod;
}
ll qpow(ll a,ll b=mod-2){
	ll ans=1;
	for(;b>0;b/=2,(a*=a)%=mod){
		if(b%2==1){
			(ans*=a)%=mod;
		}
	}
	return ans;
}
void dfs(ll u){
	sz[u]=1;
	ll ss=0;
	for(ll v:T[u]){
		if(v==fa[u]){
			continue;
		}
		fa[v]=u;
		dfs(v);
		sz[u]+=sz[v];
		(ss+=s[v])%=mod;
	}
	s[u]=(ss+sq(sz[u]))%mod;
	for(ll v:T[u]){
		if(v==fa[u]){
			continue;
		}
		(ans+=sq(sz[v])*sq(n-sz[v]))%=mod;
		(ans+=2*sq(n-sz[v])*(s[v]-sq(sz[v])))%=mod;
		(ans+=s[v]*(ss-s[v]))%=mod;
	}
}
void solve(){
	cin>>n;
	rep(i,1,n){
		T[i].clear();
	}
	rep(i,1,n-1){
		ll u,v;
		cin>>u>>v;
		T[u].pb(v);
		T[v].pb(u);
	}
	ans=0;
	dfs(1);
	ll ip=qpow(n*(n-1)/2%mod);
	cout<<ans*sq(ip)%mod<<'\n';
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0);
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	ll t;
	cin>>t;
	rep(i,1,t){
		solve();
	}
	return 0;
}
/**
 * typeperf "\Process(test)\Working Set Peak" -si 2
 * TODO: delete while(1);
 * TODO: multitest cleanup
 */