#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

void solve()
{
  const int mod = 998244353;
  int n;
  cin >> n;
  vector<vector<int>> g(n);
  for (int i = 1; i < n; ++i)
  {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  vector<vector<long long>> dp(n, vector<long long> (4));
  long long ans = 0;
  auto dfs = [&](auto dfs, int now, int p) -> void
  {
    for (auto to : g[now])
    {
      if (to == p) continue;
      dfs(dfs, to, now);
    }
    dp[now][0] = 1;
    for (auto to : g[now])
    {
      if (to == p) continue;
      for (int i = 0; i < 3; ++i) dp[now][i + 1] += dp[to][i];
    }
    ans = (ans + dp[now][3]) % mod;
    for (auto to : g[now])
    {
      if (to == p) continue;
      long long v1 = dp[now][2] - dp[to][1] + mod, v2 = dp[to][0];
      ans = (ans + v1 * v2) % mod;
    }
  };
  dfs(dfs, 0, -1);
  cout << ans << endl;
}

int main()
{
  int t;
  cin >> t;
  while (t--) solve();
}