#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long llint;

inline int read()
{
    int ans = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ans = ans * 10 + ch - '0';
        ch = getchar();
    }
    return ans * w;
}
const llint mods = 998244353;
llint qpow(llint a,llint b){
    llint ans = 1;
    while(b){
        if(b&1)
            ans = ans * a % mods;
        a = a * a % mods;
        b >>= 1;
    }
    return ans;
}

llint inv2;
llint ans = 0;
int n;
int in[500005];
int head[500005], tot;
struct D
{
    int to, next;
} edge[1000005];
inline void init()
{
    memset(head, 0, sizeof(int) * (n + 1));
    memset(in, 0xff, sizeof(int) * (n + 1));
    tot = 1;
    ans = 0;
}
inline void adde(int u, int v)
{
    edge[tot] = {v, head[u]};
    head[u] = tot++;
}

int tmpin[500005], tmptot;

void dfs(int u, int fa)
{

    llint sum = 0;
    for (int i = head[u]; i; i = edge[i].next)
    {
        int v = edge[i].to;
        
        if (fa == v)
            continue;
        dfs(v, u);
    }

    if(in[u]<3)
        return;

    

    tmptot = 0;
    for (int i = head[u]; i; i = edge[i].next)
    {
        int v = edge[i].to;
        if (in[v])
        {
            sum = (sum + in[v]) % mods;
            tmpin[tmptot++] = in[v];
        }
    }

    

    llint tmp = sum * (sum - 1) % mods;
    //cout << tmp << endl;
    for (int i = 0; i < tmptot; i++)
    {
        tmp -= tmpin[i] * (tmpin[i] - 1) % mods;
        tmp = (tmp % mods + mods) % mods;
    }
    tmp = tmp * inv2 % mods;
    //cout << tmp << endl;

    for (int i = head[u]; i; i = edge[i].next)
    {
        int x = edge[i].to;
        if(in[x]<2) continue;
        llint C = in[x] * (in[x] - 1) % mods *inv2 % mods;
        llint ans1 = ((tmp - in[x]*(sum - in[x])%mods)%mods+mods)%mods;
        ans += C * ans1 % mods * (in[u] - 2);
        //cout << C << ' ' << ans1 << ' ' << (in[u] - 2) << endl;
        ans %= mods;
    }
}

inline void solve()
{
    n = read();
    init();
    for (int i = 1; i < n; i++)
    {
        int u = read(), v = read();
        adde(u, v);
        adde(v, u);
        in[u]++;
        in[v]++;
    }
    dfs(1, 0);
    printf("%lld\n", ans);
}

int main()
{
    // IO;
    //  init();
    inv2 = qpow(2, mods - 2);
    int tt = 1;
    tt = read();
    //   scanf("%d", &tt);
    while (tt--)
    {
        solve();
        // cout << tt << endl;
    }
}