#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    std::vector<std::vector<int>> G(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        std::cin >> u >> v;
        u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }   
    std::vector<int> f(n);
    auto dfs1 = [&](auto self, int u, int fa) -> void {
        for (int v: G[u]) {
            if (v == fa) continue;
            self(self, v, u);
            f[u] ^= f[v] + 1;
        }
    };

    std::vector<int> ans(n);
    auto dfs2 = [&](auto self, int u, int fa) -> void {
        for (int v: G[u]) {
            if (v == fa) continue;
            ans[v] = f[v] ^ ((ans[u] ^ (ans[v] + 1)) + 1);
            self(self, v, u);
        }
    };

    dfs1(dfs1, 0, -1);
    ans[0] = f[0];
    dfs2(dfs2, 0, -1);
    constexpr int mod = 1e9 + 7;
    i64 res = 0;
    auto qmi = [&](i64 a, int k) -> int{
        i64 res = 1;
        while (k) {
            if (k & 1) res = res * a % mod;
            k >>= 1;
            a = (i64) a * a % mod;
        }
        return res % mod;
    };

    for (int i = 0; i < n; i++) {
        if (ans[i]) {
            res ++;
        }
    }    
    std::cout << res * qmi(n, mod - 2) % mod << "\n";
}


int main() {
    std::ios::sync_with_stdio(false); 
    std::cin.tie(nullptr);
    int t;
    std::cin >> t;
    while (t --)
        solve();
    return 0;
}