#include<iostream>
#include<vector>
using namespace std;

#define int long long
const int MAXN = 2 * 1e5 + 5;
const int MOD = 1e9 + 7;
int sz[MAXN], n;
vector<int> G[MAXN];

int qpow(int a){
    int b = MOD - 2;
    int res = 1;
    while(b){
        if(b & 1) (res *= a) %= MOD;
        (a = a * a) %= MOD;
        b >>= 1;
    }
    return res;
}

void dfs(int u, int f){
    sz[u] = 1;
    for(int v : G[u]){
        if(v == f) continue;
        dfs(v, u);
        sz[u] += sz[v];
    }
}

void solve(){
    cin >> n;
    for(int i = 1;i <= n;i ++){
        G[i].clear();
    }
    for(int i = 1;i < n;i ++){
        int u, v; cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int ans = 0;
    for(int i = 1;i <= n;i ++){
        dfs(i, 0);
        int cnt = 1;
        for(int j = 1;j <= n;j ++){
            cnt = (cnt * sz[j]) % MOD;
        }
        ans = (ans + qpow(cnt)) % MOD;
    }
    while(-- n){
        ans = (ans * qpow(n)) % MOD;
    }
    cout << ans << '\n';
}

signed main(){
    freopen("Random.in", "r", stdin);
    freopen("Random.out", "w", stdout);
    cin.tie(0) -> ios::sync_with_stdio(0);
    int t; cin >> t;
    while(t --){
        solve();
    }
    return 0;
}