#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    int n;
    cin >> n;
    VVI to(n);
    rep(_, n - 1) {
      int u, v;
      cin >> u >> v;
      u--, v--;
      to[u].emplace_back(v);
      to[v].emplace_back(u);
    }
    mint ans;
    VI sz(n, 1);
    mint n2i = (mint(n) * (n + 1)).inv();
    auto dfs = [&](auto&& self, int u, int par) -> void {
      for (int v: to[u]) if (v != par) {
        self(self, v, u);
        sz[u] += sz[v];
      }
      {
        mint p;
        for (int v: to[u]) if (v != par) {
          p += mint(sz[v]) * (sz[v] + 1);
        }
        p += mint(n - sz[u]) * (n - sz[u] + 1);
        p *= n2i;
        ans += 1 / p;

      }
      for (int v : to[u]) if (v != par) {
        mint p;
        p += mint(sz[v]) * (sz[v] + 1);
        p += mint(n - sz[v]) * (n - sz[v] + 1);
        p *= n2i;
        ans -= 1 / p;
      }
    };
    dfs(dfs, 0, -1);
    cout << ans.val() << '\n';
  }
}