#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <numeric>

using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)

vector<vector<int> > g;
bool flag[200010];
int s[200010];

void dfs(int a,int pre){
    s[a] = s[pre]+1;
    flag[a] = 1;
    for(auto x:g[a]){
        if(flag[x])continue;
        dfs(x,a);
    }
}
ll ruijo(ll x,ll n){
	long long p,ans;
	if(n==0)return 1;
	if(n==1)return x;
	if(n%2){
		p = ruijo(x,n/2);
		ans = (x*p)%mod;
		ans = (ans*p)%mod;
		return ans;
	}else{
		p = ruijo(x,n/2);
		ans = (p*p)%mod;
		return ans;
	}
}

int main(){
    int n;
    cin >> n;
    g.resize(n);
    rep(i,n-1){
        int u,v;
        cin >> u >> v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(0,0);
    ll kai[200010]={};
    kai[0] = 1;
    
    for(ll i=1;i<=200000;i++){
        kai[i] = i*kai[i-1] %mod;
    }
    ll p[200010] = {};
    for(int i=1;i<=200000;i++){
        p[i] = kai[n]*ruijo(i,mod-2)%mod;
    }
    ll res = 0;
    for(int i=0;i<n;i++){
        res += p[s[i]];
        res %= mod;
    }
    cout << res << endl;
    return 0;
}