#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k>0){
        if(k%2==1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k/=2;
    }
    return ans;
}
ll inv(ll a){
	return powmod(a, MOD-2);
}
int main()
{
	int n;
	cin>>n;
	if(n==1){
	    cout<<1<<endl;
	    return 0;
	}
	vector<int> g[100000];
	for(int i=0; i<n-1; i++){
		int a, b;
		cin>>a>>b;
		a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	int m=0;
	for(int i=1; i<n; i++){
		if(g[i].size()==1) m++;
	}
	if(m==1){
		cout<<1<<endl;
		return 0;
	}
	ll f[100001];
	f[0]=1;
	for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
	ll invf[100001];
	invf[n]=inv(f[n]);
	for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
	cout<<f[n-1]*invf[n-m]%MOD*invf[m-1]%MOD*f[n-2]%MOD*invf[m-1]%MOD*invf[n-m-1]%MOD*inv(m)%MOD<<endl;
	return 0;
}