#include<bits/stdc++.h>
#define ll long long
#define mod 998244353
using namespace std;
ll n,siz[100010],mson[100010];
ll dfl[100010],dfr[100010];
ll dep[100010];
ll sum[100010];
ll inv[100010];
ll dfn,ans;
vector<ll>e[100010];
vector<ll>c[100010];
ll k0,k1,k2;
ll ksm(ll x,ll y)
{
    ll res=1;
    while(y)
    {
        if(y&1)res=res*x%mod;
        x=x*x%mod;
        y=y/2;
    }
    return res;
}
void dfs(ll x,ll pre)
{
    dep[x]=dep[pre]+1;
    dfn++;
    inv[dfn]=x;
    c[x].clear();
    dfl[x]=dfn;
    dfr[x]=dfn;
    siz[x]=1;
    for(auto y:e[x])
    {
        if(y==pre)continue;
        dfs(y,x);
        c[x].push_back(siz[y]);
        siz[x]+=siz[y];
        dfr[x]=dfr[y];
        if(mson[x]==0||siz[mson[x]]<siz[y])mson[x]=y;
    }
    c[x].push_back(n-siz[x]);
}
void dfs1(ll x,ll pre,ll keep)
{
    for(auto y:e[x])
    {
        if(y==pre||y==mson[x])continue;
        dfs1(y,x,0);
    }
    if(mson[x])
    {
        dfs1(mson[x],x,1);
        ll t=((sum[mson[x]]-(n-siz[mson[x]])*(siz[mson[x]]-1)%mod*2%mod+mod)%mod+(2*siz[mson[x]]-1))%mod;
        k2=(k2+2*k1+k0+t)%mod;
        k1=(k1+k0+t)%mod;
        k0=(k0+t)%mod;
    }
    for(auto y:e[x])
    {
        if(y==mson[x]||y==pre)continue;
        for(int j=dfl[y];j<=dfr[y];j++)
        {
            ll t=((sum[inv[j]]-(n-siz[inv[j]])*(siz[inv[j]]-1)%mod*2%mod+mod)%mod+(2*siz[inv[j]]-1)%mod)%mod;
            ll len=dep[inv[j]]-dep[x];
            ans=(ans+(t*k2%mod+2*t%mod*len%mod*k1%mod+t*k0%mod*len%mod*len%mod)%mod)%mod;
        }
        for(int j=dfl[y];j<=dfr[y];j++)
        {
            ll t=((sum[inv[j]]-(n-siz[inv[j]])*(siz[inv[j]]-1)%mod*2%mod+mod)%mod+(2*siz[inv[j]]-1)%mod)%mod;
            ll len=dep[inv[j]]-dep[x];
            k2=(k2+t*len%mod*len%mod)%mod;
            k1=(k1+t*len%mod)%mod;
            k0=(k0+t)%mod;
        }
    }
    if(keep==0)
    {
        for(auto y:e[x])
        {
            if(y==pre)continue;
            for(int j=dfl[y];j<=dfr[y];j++)
            {
                ll t=((sum[inv[j]]-(n-siz[inv[j]])*(siz[inv[j]]-1)%mod*2%mod+mod)%mod+(2*siz[inv[j]]-1)%mod)%mod;
                ll len=dep[inv[j]]-dep[x];
                k2=(k2-t*len%mod*len%mod+mod)%mod;
                k1=(k1-t*len%mod+mod)%mod;
                k0=(k0-t+mod)%mod;
            }
        }
    }
}
ll f0[100010],f1[100010],f2[100010];
void dfs2(ll x,ll pre)
{
    f2[x]=0;
    f1[x]=0;
    f0[x]=0;
    for(auto y:e[x])
    {
        if(y==pre)continue;
        dfs2(y,x);
        ans=(ans+(f2[y]+2*f1[y]+f0[y]+(sum[y]-(n-siz[y])*(siz[y]-1)%mod*2%mod)+2*siz[y]-1)%mod*(sum[x]-siz[y]*(n-siz[y]-1)%mod*2%mod+mod+2*(n-siz[y])-1)%mod);
        ll t=((sum[y]-(n-siz[y])*(siz[y]-1)%mod*2%mod+mod)%mod+(2*siz[y]-1))%mod;
        f2[x]=(f2[x]+f2[y]+2*f1[y]+f0[y]+t)%mod;
        f1[x]=(f1[x]+f1[y]+f0[y]+t)%mod;
        f0[x]=(f0[x]+t)%mod;
    }
}
void work()
{
    k0=0;k1=0;k2=0;
    cin>>n;
    dfn=0;ans=0;
    for(int i=1;i<=n;i++)e[i].clear(),mson[i]=0;
    for(int i=1;i<n;i++)
    {
        ll x,y;
        cin>>x>>y;
        e[x].push_back(y);
        e[y].push_back(x);
    }
    dfs(1,0);
    for(int i=1;i<=n;i++)
    {

        ll s=0;
        sum[i]=0;
        for(auto y:c[i])
        {
            sum[i]=(sum[i]+s*y%mod)%mod;
            s+=y;
        }
        sum[i]=sum[i]*2%mod;
    }
    dfs1(1,0,0);
    dfs2(1,0);
    ll t1=n*(n-1)%mod*ksm(2,mod-2)%mod;
    t1=t1*t1%mod;
    cout<<ans*ksm(t1,mod-2)%mod<<'\n';
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T;
    cin>>T;
    while(T--)
    {
        work();
    }
}