#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (k); i >= (j); i--)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
using VI = std::vector<int>;
using ll = long long;
using PII = std::pair<int, int>;
using db = double;
using namespace std;

const int mod = 1000000007;

inline void add(int &x, int y, int md = mod) { x += y; if (x >= md) x -= md; }
inline void sub(int &x, int y, int md = mod) { x -= y; if (x < 0) x += md; }
inline void mul(int &x, int y, int md = mod) { x = (int)(1ll * x * y % mod); if (x < 0) x += mod; }

template<typename T>
inline int powmod(int a, T e, int md = mod) {
    int res = 1;
    a %= md;
    assert(e >= 0);
    for (; e; e>>=1, mul(a, a, md))
        if (e & 1)
            mul(res, a, md);
    return res;
}

inline int inv(int x, int md = mod) {
    x %= md;
    if (x < 0) x += md;
    int y = md, u = 0, v = 1;
    while (x) {
        int w = y / x;
        y -= w * x; swap(x, y);
        u -= w * v; swap(u, v);
    }
    assert(y == 1);
    if (u < 0) u += md;
    return u;
}

const int N = 201000;
int n, sg[N], sg2[N];
VI adj[N];

void dfs1(int u, int f = 0) {
	sg[u] = 0;
	for (auto v : adj[u]) if (v != f) {
		dfs1(v, u);
		sg[u] ^= sg[v] + 1;
	}
}

void changeroot(int u, int f = 0) {
	for (auto v : adj[u]) if (v != f) {
		sg2[v] = sg[v] ^ ((sg2[u] ^ (sg[v] + 1)) + 1);
		changeroot(v, u);
	}
}

void solve() {
	cin >> n;
	rep(i, 1, n) adj[i].clear();
	rep(i, 1, n - 1) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs1(1);
	sg2[1] = sg[1];
	changeroot(1);
	int ans = 0;
	rep(i, 1, n) if (sg2[i]) ans += 1;
	cout << 1ll * ans * inv(n) % mod << "\n";
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

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