#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


int e[N], ne[N], h[N], idx;
ll f[200010][4], res;
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }

void dfs(int r, int fa) {
    f[r][1] = f[r][2] = f[r][3] = 0;
    for (int i = h[r]; ~i; i = ne[i]) {
        int j = e[i];
        if (j == fa) continue;
        dfs(j, r);
        res = (res + f[r][2] + f[j][1] * f[r][1]) % MOD;
        f[r][1]++, f[r][2] += f[j][1], f[r][3] += f[j][2];
    }
    res = (res + f[r][3]) % MOD;
}

void solve() {
    res = 0;
    dfs(1, -1);
    int r = 1;
    printf("%lld\n", res);
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        memset(h, -1, sizeof(int) * (n + 10));
        idx = 0;
        for (int i = 1, a, b; i < n; i++) {
            scanf("%d%d", &a, &b);
            add(a, b), add(b, a);
        }
        solve();
    }
    return 0;
}