#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
const int mod = 998244353;
typedef long long LL;

int n;
int h[N], e[N << 1], ne[N << 1], idx;
LL si[N], sum[N];
LL ans;

void add(int a, int b) {
    e[++idx] = b, ne[idx] = h[a], h[a] = idx;
}

LL dfs(int u, int father) {
    si[u] = 1;
    sum[u] = 0;
    LL pre_sum = 0;
    LL tmppre_sum = 0;
    for (int i = h[u]; i; i = ne[i]) {
        int j = e[i];
        if (j == father) continue;
        LL x = dfs(j, u);
        tmppre_sum = (tmppre_sum + pre_sum * sum[j]) % mod;
        pre_sum += sum[j]; 
        
        LL tmp1 = x * x % mod;
        LL tmp2 = (n - x) * (n - x) % mod;
        ans = (ans + tmp1 * tmp2 % mod) % mod;
        ans = (ans + tmp2 * (sum[j] - tmp1) % mod * 2) % mod;
        
        si[u] += x;
        sum[u] += x * x;
    }
    ans = (ans + tmppre_sum * 2) % mod;
    sum[u] = (sum[u] + si[u] * si[u]) % mod;
    return si[u];
}

LL quick_pow(LL base, LL power, LL mod) {
    LL ans = 1;
    while (power) {
        if (power & 1) ans = base * ans % mod;
        base = base * base % mod;
        power >>= 1;
    }
    return ans;
}

void solve() {
    ans = 0, idx = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        sum[i] = si[i] = h[i] = 0;
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        add(u, v), add(v, u);
    }
    dfs(1, -1);
    LL y = (LL)n * (n - 1) / 2;

    LL x = quick_pow(y * y % mod, mod - 2 , mod);
    x = (x + mod) % mod;
    printf("%lld\n", ans * x % mod);
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}