#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;

template <class T> struct csr {
    using itr = typename std::vector<T>::iterator;
    struct Node {
        itr st, en;
        itr begin() { return st; }
        itr end() { return en; }
        int size() { return en - st; }
        T operator[](int p){ return st[p]; }
    };
    const int N;
    std::vector<int> start;
    std::vector<T> E;
    std::vector<std::pair<int,T>> edge;
    csr(int n) : N(n), start(n + 1) {}
    void add_edge(int u, T v){
        assert(0 <= u && u < N);
        start[u + 1]++;
        edge.emplace_back(u, v);
    }
    void build(){
        E.resize(edge.size());
        for(int i = 0; i < N; i++) start[i + 1] += start[i];
        auto cnt = start;
        for(auto [u, v] : edge) E[cnt[u]++] = v;
    }
    Node operator[](int p) {
        return Node{E.begin() + start[p], E.begin() + start[p + 1]};
    }
};

void solve(){
    int n;
    cin >> n;
    csr<int> g(n);
    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        u--, v--;
        g.add_edge(u, v);
        g.add_edge(v, u);
    }
    g.build();
    mint ans;
    auto dfs = [&](auto dfs, int v, int p) -> array<mint, 4> {
        array<mint, 4> dp0;
        for(auto u : g[v]){
            if(u == p) continue;
            auto rc = dfs(dfs, u, v);
            ans += rc[3];
            ans += rc[1] * dp0[2];
            ans += rc[2] * dp0[1];
            dp0[3] += rc[3];
            dp0[2] += rc[2];
            dp0[1] += rc[1];
        }
        dp0[3] = dp0[2];
        dp0[2] = dp0[1];
        dp0[1] = 1;
        return dp0;
    };
    dfs(dfs, 0, -1);
    cout << ans.val() << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) solve();
}