#include <bits/stdc++.h>
typedef long long i64;
using std::cout;
using std::endl;
using std::cin;

std::vector<std::vector<int>> g;
int count(int v = 0, int par = -1) {
	int ret = 0;
	bool f = true;
	for(auto e : g[v]) {
		if(e == par) continue;
		ret += count(e, v);
		f = false;
	}
	
	return ret + f;
}

const int MOD = 1e9 + 7;
i64 mod_pow(i64 x, int n = MOD - 2, int mod = MOD) {
	i64 ret = 1;
	while(n) {
		if(n & 1) (ret *= x) %= MOD;
		(x *= x) %= MOD;
		n >>= 1;
	}
	return ret;
}

std::vector<i64> fact;
i64 comb(int n, int r) {
	return fact[n] * mod_pow(fact[n - r]) % MOD * mod_pow(fact[r]) % MOD;
}

int main() {
	int n; scanf("%d", &n); g.resize(n); fact.resize(n + 1, 1);
	for(i64 i = 0; i < n; i++) fact[i + 1] = fact[i] * (i + 1) % MOD;
	for(int i = 0; i < n - 1; i++) {
		int a, b; scanf("%d %d", &a, &b);
		
		g[a - 1].push_back(b - 1);
		g[b - 1].push_back(a - 1);
	}
	int k = count();
	
	printf("%lld\n", comb(n - 1, k - 1) * comb(n - 2, k - 1) % MOD * mod_pow(k) % MOD);
	return 0;
}