#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VV = vector<vector<ll> >;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void vprint(vector<ll> A){
    ll L = A.size();
    FOR(i, 0, L){
        if(i) cout << ' ';
        cout << A[i];
    }
    cout << endl;
}

VV G;
vector<ll> D;

void dfs(ll i, ll depth){
    D[i] = depth;
    for(ll to : G[i]){
        if(D[to]==-1){
            dfs(to, depth+1);
        }
    }
}

ll mod_pow(ll a, ll b){
    if(b==0) return 1;
 
    // 肩が奇数
    if(b%2==1){
        return a * mod_pow(a, b-1) % mod;
    }
    else{
        return mod_pow(a*a % mod, b/2) % mod;
    }
}



int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    D.resize(N, -1);

    G.resize(N);
    FOR(i, 0, N-1){
        ll u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    dfs(0, 0);
    
    // N!
    ll ans = 1;
    FOR(i, 1, N+1){
        ans *= i;
        ans %= mod;
    }

    ll sum = 0;
    FOR(i, 0, N){
        ll d = D[i];

        // 逆元
        sum += mod_pow(d+1, 1000000005);
        sum %= mod;
    }

    ll a = ans * sum;
    a %= mod;
    p(a);
    
    return 0;
}