#include <iostream>
#include <vector>
#define llint long long
#define mod 1000000007

using namespace std;

llint n;
vector<llint> G[200005];
llint cnt[200005];

const int FACT_MAX = 200005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

void make_fact()
{
	llint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		val %= mod;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = modpow(fact[FACT_MAX-1], mod-2);
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1) % mod;
	}
}

llint comb(llint n, llint k)
{
	llint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k], ret %= mod;
	ret *= fact_inv[n-k], ret %= mod;
	return ret;
}

void dfs(int v, int p, int d)
{
	cnt[d]++;
	for(int i = 0; i < G[v].size(); i++){
		if(G[v][i] == p)  continue;
		dfs(G[v][i], v, d+1);
	}
}

int main(void)
{
	cin >> n;
	int u, v;
	for(int i = 1; i < n; i++){
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	make_fact();
	
	dfs(1, -1, 0);
	
	llint ans = 0;
	for(int i = 0; i <= n; i++){
		ans += fact[n] * modpow(i+1, mod-2) % mod * cnt[i] % mod;
		ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}