#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long fac[200020], finv[200020], inv[200020];
long long mod = 1000000007;
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < 200020; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}
long long COM(long long n, long long k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long k[200020], co[200020] = {};
vector<vector<int>> vec(200020);
bool bo[200020] = { false };
int main(){
	COMinit();
	int n;
	cin >> n;
	k[0] = 1;
	long long k1 = 1;
	for (long long i = 1; i <= n; i++) {
		k1 *= i;
		k1 %= mod;
		k[i] = k1;
	}
	for (int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v;
		vec[u].emplace_back(v);
		vec[v].emplace_back(u);
	}
	queue<int> que;
	que.push(1);
	bo[1] = true;
	while (!que.empty()) {
		int now = que.front();
		for (int i = 0; i < vec[now].size(); i++) {
			if (!bo[vec[now][i]]) {
				co[vec[now][i]] = co[now] + 1;
				que.push(vec[now][i]);
				bo[vec[now][i]] = true;
			}
		}
		que.pop();
	}
	long long ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += COM(n, co[i] + 1) * k[co[i]] % mod * k[n - co[i] - 1] % mod;
		ans %= mod;
	}
	cout << ans << endl;
}