#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int N;
vector<vector<int>> v(200010);
ll d[200010],cnt[200010] = {},inf = 1e9+7;
ll fact[200010] = {0};
ll inv[200010] = {0};

ll mult(ll n, ll m){
	if(m==1) return n%inf;
	else if(m%2==0){
		ll t = mult(n,m/2);
		return (t*t)%inf;
	}else{
		ll t = mult(n,m-1);
		return (t*n)%inf;
	}
}

void factorial(ll N){
	for(ll i=0;i<=N;i++){
		if(i==0){
			fact[i] = 1;
			inv[i] = 1;
		}
		else{
			fact[i] = (i*fact[i-1])%inf;
			inv[i] = mult(fact[i],inf-2);
		}
	}
}

ll comb(ll n,ll k){
	if(n<k) return 0;
	if(n<0 || k<0) return 0;
	else return (((fact[n]*inv[k])%inf)*inv[n-k])%inf;
}

ll permutation(ll n,ll k){
    return comb(n,k)*fact[k]%inf;
}

void dfs(int n,int m){
    for(auto x:v[n]){
        if(x!=m){
            d[x] = d[n]+1;
            dfs(x,n); 
        }
    }
}

int main(){
    cin >> N;
    factorial(N);
    int a,b;
    for(int i=0;i<N-1;i++){
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    d[1] = 1;
    dfs(1,0);
    ll ans = 0;
    for(int i=1;i<=N;i++) cnt[d[i]]++;
    for(int i=1;i<=N;i++){
        (ans += comb(N,i)*fact[i-1]%inf*fact[N-i]%inf*cnt[i]%inf)%=inf;
    }
    cout << ans << endl;
}