#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
const int MX=100020;
const int p=998244353;

int N, M, T;
int head[MX], cnt=1;
int siz[MX], sum[MX];//sum[u] = \sum_{v \in tree(u)} siz[v]*siz[v]
int v1[MX], v2[MX];  //v1[i] = e[i] 的贡献
                     //给边的有序对 <e_i,e_j> 按照 lca 分类, v2[u]=lca 为 u 的边对贡献
                     //ans = (sumv1+sumv2) / (N*(N-1)/2)^2
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct edge{int nxt, to;}e[2*MX];
inline void ae(int u, int v){e[++cnt].to=v; e[cnt].nxt=head[u]; head[u]=cnt;}
int qpow(int x, int pow)
{
    int ans=1;
    while(pow)
    {
        if(pow&1) ans=ans*x%p;
        x=x*x%p;
        pow>>=1;
    }
    return ans;
}
int inv(int x){return qpow(x,p-2);}
int ord123(int &x){return ((x%p)+p)%p;}
void dfs(int x, int f)
{
    siz[x]=1;
    for(int i=head[x],now=0;i;i=e[i].nxt)
    {
        int y=e[i].to;
        if(y==f) continue;
        dfs(y,x);
        siz[x]+=siz[y];
        sum[x]+=sum[y]; 
        v1[i/2]=siz[y]*(N-siz[y])%p*siz[y]%p*(N-siz[y])%p;
        v2[x]=v2[x]+2*(N-siz[y])*(N-siz[y])%p*(sum[y]-siz[y]*siz[y]%p)%p; //same subtree
        v2[x]=v2[x]+2*sum[y]*now%p; //dif subtree
        now=(now+sum[y])%p;
        ord123(v2[x]);
    }
    sum[x]=(sum[x]+siz[x]*siz[x]%p)%p;
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read();
        for(int i=1;i<N;i++)
        {
            int u=read(), v=read();
            ae(u,v); ae(v,u);
        }
        dfs(1,0);
        int bel=qpow(N*(N-1)%p*inv(2)%p,2);
        int fac=0;
        for(int i=1;i<=N;i++)
            fac=(fac+v1[i]+v2[i])%p;
        ord123(fac);
        cout << fac*inv(bel)%p << '\n';
        for(int i=1;i<=N;i++) head[i]=v1[i]=v2[i]=siz[i]=sum[i]=0; cnt=1;
    }
    return (0-0);
}