#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

constexpr int P = 1e9 + 7;
inline int qp(int a, int b = P - 2) {
  int res = 1;
  while (b) {
    if (b & 1) {
      res = i64(res) * a % P;
    }
    a = i64(a) * a % P;
    b /= 2;
  }
  return res;
}

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> f(n);
  auto dfs1 = [&](auto self, int u, int fa) -> void {
    f[u] = 0;
    for (auto v : G[u]) {
      if (v == fa) {
        continue;
      }
      self(self, v, u);
      f[u] ^= (f[v] + 1);
    }
  };
  int cnt = 0;
  auto dfs2 = [&](auto self, int u, int fa) -> void {
    if (f[u]) {
      cnt++;
    }
    for (auto v : G[u]) {
      if (v == fa) {
        continue;
      }
      int fu = f[u];
      int fv = f[v];
      f[u] ^= (f[v] + 1);
      f[v] ^= (f[u] + 1);
      self(self, v, u);
      f[u] = fu;
      f[v] = fv;
    }
  };
  dfs1(dfs1, 0, -1);
  dfs2(dfs2, 0, -1);
  cout << i64(cnt) * qp(n) % P << "\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}