#include <bits/stdc++.h>

struct Node {
	int depth{-1};
	std::list<int> edge;
	bool visited{};
};

constexpr long long mod{1'000'000'007};
constexpr long long max{1000'000};

std::vector<Node> graph;
long long fac[max + 1], finv[max + 1], inv[max + 1];

void dfs(int, int);

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i <= max; 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(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main()
{
	COMinit();
	int N;
	scanf("%d", &N);
	graph.resize(N);
	for (int i{}; i < N - 1; i++)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		u--; v--;
		graph[u].edge.push_back(v);
		graph[v].edge.push_back(u);
	}
	dfs(0, 0);
	long long ans{};
	for (auto& e: graph)
		ans = (ans + COM(N, e.depth + 1) * fac[e.depth] % mod * fac[N - e.depth - 1] % mod) % mod;
	printf("%lld\n", ans);

	return 0;
}

void dfs(int index, int depth)
{
	if (graph[index].depth >= 0) return;
	graph[index].depth = depth;
	for (auto& e: graph[index].edge)
		dfs(e, depth + 1);
	return;
}