#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

mint comb2(int n){
    return mint(n)*mint(n+1)/2;
}

void solve(){
    int n; cin >> n;
    vector<vector<int>> g(n);    
    for(int i = 0; i < n-1; i++){
        int u, v; cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> cnt(n);
    mint cb = comb2(n);
    mint ans = 0;
    function<void(int, int)> dfs = [&](int v, int par){
        cnt[v]++;
        mint only_child = 0;
        for(int to: g[v]){
            if(to == par) continue;
            dfs(to, v);
            cnt[v] += cnt[to];
            only_child += comb2(cnt[to]);
        }
        mint p_pass_v = (cb-only_child-comb2(n-cnt[v]))/cb;
        mint p_lca_v = (comb2(cnt[v]) - only_child)/cb;
        mint q = p_pass_v-p_lca_v;
        ans += p_pass_v/(mint(1)-p_pass_v) - q/(mint(1)-q);
    };
    dfs(0, -1);
    ans += 1;
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}