#include <iostream>
#include <vector>
using namespace std;
const int N = 1e5 + 5, MOD = 998244353;
int inc(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; }
int dec(int a, int b) { return a < b ? a - b + MOD : a - b; }
int mul(int a, int b) { return 1ll * a * b % MOD; }
int power(int a, int b) {
    int ans = 1;
    for (; b; b >>= 1, a = mul(a, a))
        if (b & 1)
            ans = mul(ans, a);
    return ans;
}
int inv(int a) { return power(a, MOD - 2); }
int t, n, ans, siz[N], sum[N];
vector<int> edg[N];
void dfs(int x, int f) {
    siz[x] = 1, sum[x] = 0;
    for (int e : edg[x])
        if (e != f)
            dfs(e, x), siz[x] += siz[e], sum[x] = inc(sum[x], sum[e]);
    int cnt = 0;
    for (int e : edg[x])
        if (e != f) {
            ans = inc(ans, mul(mul(siz[e], siz[e]), mul(n - siz[x], n - siz[x])));
            ans = inc(ans, mul(mul(n - siz[e], n - siz[e]), sum[e]));
            ans = inc(ans, mul(2, mul(cnt, sum[e]))), cnt = inc(cnt, sum[e]);
        }
    sum[x] = inc(sum[x], mul(siz[x], siz[x]));
}
int main() {
    ios::sync_with_stdio(false);
    for (cin >> t; t; --t) {
        cin >> n, ans = 0;
        for (int i = 1; i <= n; ++i)
            edg[i].clear();
        for (int i = 1, u, v; i < n; ++i)
            cin >> u >> v, edg[u].push_back(v), edg[v].push_back(u);
        dfs(1, 0);
        cout << mul(ans, inv(mul(1ll * n * (n - 1) / 2 % MOD, 1ll * n * (n - 1) / 2 % MOD))) << "\n";
    }
}