#include <cassert>
#include <iostream>
#include <vector>

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int ChoosePair(const int n) { return n * (n + 1) / 2; }

// <AC>
// 想定解
mint Solve(const std::vector<std::vector<int>>& tree) {
  const int n = tree.size(), denominator = ChoosePair(n);
  mint ans = 0;
  const auto CalcSubtree = [&tree, n, denominator, &ans](
      auto CalcSubtree, const int parent, const int vertex) -> int {
    int subtree = 1, p_v = denominator;
    for (const int child : tree[vertex]) {
      if (child != parent) {
        const int subtree_child = CalcSubtree(CalcSubtree, vertex, child);
        subtree += subtree_child;
        p_v -= ChoosePair(subtree_child);
        // 2 番目のシグマ
        ans -= mint(denominator)
               / (denominator - subtree_child * (n - subtree_child));
      }
    }
    if (parent != -1) p_v -= ChoosePair(n - subtree);
    ans += mint(denominator) / (denominator - p_v);  // 1 番目のシグマ
    return subtree;
  };
  assert(CalcSubtree(CalcSubtree, -1, 0) == n);
  return ans;
}

int main() {
  constexpr int kMaxT = 100000, kMaxN = 40000;

  int t;
  std::cin >> t;
  assert(1 <= t && t <= kMaxT);

  while (t--) {
    int n;
    std::cin >> n;
    assert(2 <= n && n <= kMaxN);
    std::vector<std::vector<int>> tree(n);
    for (int i = 0; i < n - 1; ++i) {
      int u, v;
      std::cin >> u >> v;
      assert(1 <= u && u <= n && 1 <= v && v <= n);
      --u; --v;
      tree[u].emplace_back(v);
      tree[v].emplace_back(u);
    }
    std::cout << Solve(tree).val() << '\n';
  }
  return 0;
}