#include "bits/stdc++.h"

using namespace std;

//--------------------------------------------------------------------//

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define rep(n, i) Rep(0, n-1, i)

const int MOD = 1e9 + 7;
const int MAX = 200020;

typedef long long ll;

//階乗とその逆元
ll fac[MAX+1],facInv[MAX+1];

ll power(ll e, ll x){ //e^x % MOD
	if (x == 0) return 1LL;
	if (x % 2 != 0) return ((power(e, x-1) * e) % MOD);
	ll temp = power(e, x / 2);
	return (temp * temp) % MOD;
}

ll nck(ll n, ll k)
{
	if (!(n >= k && k >= 0))
		return 0;
	ll temp = (fac[n] * facInv[n - k]) % MOD;
	return ((temp * facInv[k]) % MOD);
}

void fact(void){
	//階乗とその逆元
	fac[0] = facInv[0] = 1; //0! = 1
	//(x!)^(-1) ≡ (x!)^(p-2) (mod p)
	Rep(1, MAX, i)
	{
		fac[i] = (fac[i - 1] * i) % MOD;
	}
	facInv[MAX] = power(fac[MAX], MOD-2);
	Rep(1, MAX-1, i) facInv[MAX-i] = (facInv[MAX-i+1] * (MAX-i+1)) % MOD;
}

//--------------------------------------------------------------------//

void solve(void)
{
	int n;
	cin >> n;
	vector<int> g[n];
	for (int i = 0; i < n-1; i++)
	{
		int u, v;
		cin >> u >> v;
		u--, v--;
		g[u].push_back(v);
		g[v].push_back(u);
	}

	queue<int> q;
	q.push(0);
	vector<int> dis(n);
	dis[0] = 1;
	while (!q.empty())
	{
		int v = q.front();
		q.pop();
		for (int nv : g[v])
		{
			if (dis[nv])
			{
				continue;
			}
			dis[nv] = dis[v] + 1;
			q.push(nv);
		}
	}
	fact();
	map<int, int> cnt;
	for (int d : dis)
	{
		cnt[d]++;
	}
	int ans = 0;
	for (auto p : cnt)
	{
		int d = p.first;
		int c = p.second;
		ans += (((((1L * nck(n, d) * fac[d - 1]) % MOD) * fac[n-d]) % MOD) * c) % MOD;
		ans %= MOD;
	}

	cout << ans << endl;
}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}