#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 212345
#endif

int N;

vector< set<int> > E(SIZE);
int D[SIZE];

void add_edge(int u, int v) {
    E[u].insert(v);
    E[v].insert(u);
}

void dfs(int parent=-1, int i=0, int depth=0) {
    D[i] = depth;
    for (auto e : E[i]) {
        if (e == parent) continue;
        dfs(i, e, depth+1);
    }
}

const int MAX = SIZE;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

/**********************************************************/


void solve() {
    cin>>N;
    int u,v;
    REP(i,N-1) {
        cin>>u>>v;
        add_edge(--u, --v);
    }
    dfs();
    COMinit();
    
    int ans = 0;
    REP(i,N) (ans += inv[D[i]+1]) %= MOD;
    ans *= fac[N];
    ans %= MOD;
    cout << ans << endl;
}