#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

int n;
const int maxN = 5e5 + 10;
vector<int> g[maxN];
int deg[maxN];
int S[16];
int D[4];
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        deg[i] = 0;
        g[i].clear();
    }
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
        deg[a]++;
        deg[b]++;
    }
    const int inv2 = (mod + 1) / 2;
    int ANS = 0;
    for (int i = 1; i <= n; i++) {
        if ((int)g[i].size() < 4) continue;
        memset(S, 0, sizeof S);
        S[0] = 1;
        for (int to : g[i]) {
            D[0] = 1;
            D[1] = deg[to] - 1;
            D[2] = deg[to] - 1;
            D[3] = mult(inv2, mult(deg[to] - 1, deg[to] - 2));
            for (int z = 15; z >= 0; z--) {
                for (int bit = 0; bit < 4; bit++) {
                    if (!(z & (1 << bit))) {
                        S[z ^ (1 << bit)] = sum(S[z ^ (1 << bit)], mult(S[z], D[bit]));
                    }
                }
            }
        }
        ANS = sum(ANS, mult(S[15], inv2));
    }
    cout << ANS << '\n';

}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}