#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long; 
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    int n; cin >> n;
    vvi adj(n);
    rep(i, n-1){
        int u, v; cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    vvi child(n);
    vi pa(n, -1); pa[0] = 0;
    queue<int> q; q.push(0);
    while(!q.empty()){
        auto u = q.front(); q.pop();
        for(auto v : adj[u]){
            if(pa[v] == -1){
                pa[v] = u;
                child[u].push_back(v);
                q.push(v);
            }
        }
    }
    mint ans = mint(0);
    rep(i, n){
        mint s = mint(child[i].size());
        if(s.val() > 0){
            for(auto v : child[i]){
                ans += (s-1)*mint(child[v].size());
            }
        }
        if(i == 0)continue;
        for(auto v : child[i]){
            ans += mint(child[v].size());
        }
        
    }
    cout << ans.val() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t;
    while(t--)solve();
    return 0;
}