#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

ll f[200000], fi[200000];

void init(int n) {
	f[0] = 1;
	for (int i = 1; i < n; i++) {
		f[i] = f[i - 1] * i % MOD;
	}
	fi[n - 1] = modpow(f[n - 1], MOD - 2);
	for (int i = n - 1; i > 0; i--) {
		fi[i - 1] = fi[i] * i % MOD;
	}
}

ll comb(int r, int c) {
	if (r < c) return 0;
	return f[r] * fi[c] % MOD * fi[r - c] % MOD;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;

	if (n <= 2) {
		cout << 1 << endl;
		return 0;
	}

	vector< vector<int> > g(n);
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}

	int cnt = 0;
	for (int i = 1; i < n; i++) {
		cnt += (g[i].size() == 1);
	}

	init(n);
	cout << comb(n - 1, cnt - 1) * comb(n - 2, cnt - 1) % MOD * modpow(cnt, MOD - 2) % MOD << endl;
	return 0;
}