#include<iostream>
#include<queue>
#include<cstring>
#include<tuple>
//~FZY.//
#include<bits/stdc++.h>
#define Heap_int priority_queue<int, vector<int>, greater<int>>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define out(x) cout << ((x) ? "YES" : "NO") << endl
#define mod(x, P) (((x) % (P) + (P)) % (P))
//#define mod(x) (((x) % (P) + (P)) % (P))
#define ULL unsigned long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define lowbit(x) ((x) & -(x))
#define LL long long
#define pb push_back
#define gcd __gcd
#define Big __int128
#define endl "\n"
#define x first
#define y second
//#define int LL
using namespace std;
const LL N = 2e5 + 10, M = 2e6 + 10, INF = 1e9 + 7, mod = 998244353;
LL pow1(LL x,LL mi)
{
    LL ans=1;
    while(mi)
    {
        if(mi%2)
        ans=ans*x%mod;
        x=x*x%mod;
        mi/=2;
    }
    return ans;
}
vector<int>a[N];
LL dp[N],sum[N],ans=0,n;
void dfs(int u,int fa)
{
    dp[u]=1,sum[u]=0;
    for(auto i:a[u])
    {
        if(i!=fa)
        {
            dfs(i,u);
            dp[u]=(dp[u]+dp[i])%mod;
            sum[u]=(sum[u]+dp[i]*dp[i])%mod;
        }
    }
    sum[u]=(sum[u]+dp[u]*dp[u])%mod;
    LL num=0;
    for(auto i:a[u])
    {
        if(i!=fa)
        {
            ans=(ans+(n-dp[i]+mod)*(n-dp[i]+mod)%mod*((dp[i]*dp[i])%mod))%mod;
            ans=(ans+2*sum[i]*num)%mod;
            num=(num+sum[i])%mod;
            ans=(ans+((2*((sum[i]-(dp[i]*dp[i])%mod+mod)%mod))%mod)*((n-dp[i]+mod)%mod)%mod*((n-dp[i]+mod)%mod))%mod;
        }
    }
}
void solve(){
    cin>>n;
    for(int i=0;i<n-1;i++)
    {
       int u,v;
       cin>>u>>v;
       a[u].push_back(v);
       a[v].push_back(u);
    }
    ans=0;
    dfs(1,0);
    LL p=n*(n-1)%mod*pow1(2,mod-2)%mod;
    cout<<ans*pow1(p*p%mod,mod-2)%mod<<endl;
    for(int i=1;i<=n;i++)
    a[i].clear();
}
signed main(){
    IOS;

    int T = 1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}