#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
  #include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int MOD = 1e9 + 7;

struct Combination{
  const int MOD = 1e9+7;

  vector<int> fact; //　fact[i] = iの階乗
  void init(int n){
    fact.resize(n+1);
    fact[0] = fact[1] = 1;
    for(int i = 2; i <= n; i++){
      fact[i] = i * fact[i-1] % MOD;
    }
  }

  int nCr(int n, int r){ // nCr = n!/r!(n-r)!
    if(n < r) return 0;
    return fact[n] * mod_pow(fact[r]*fact[n-r]%MOD, MOD-2, MOD) % MOD;
  }

  int mod_pow(int n, int p, int MOD){ // a/n ≡ a*n^(p-2) nとpは互いに素
    int r = 1;
    for(; p > 0; p >>= 1){
      if(p & 1LL) r = (r * n) % MOD;
      n = (n * n) % MOD;
    }
    return r; // r = n^p % MOD
  }

}comb;

signed main(){

  int n; cin >> n;
  vector<vector<int>> g(n);
  for(int i = 0; i < n-1; i++){
    int u, v; cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  vector<int> dp(n, 1);
  function< void(int,int) > dfs =
  [&](int u, int pre){
    if(pre != -1) dp[u] += dp[pre];
    for(int v : g[u]){
      if(v == pre) continue;
      dfs(v, u);
    }
  };
  dfs(0, -1);

  int ans = 0;
  comb.init(n);
  for(int i = 0; i < n; i++){
    ans = (ans + comb.nCr(n, dp[i]) * comb.fact[dp[i]-1] % MOD * comb.fact[n - dp[i]]) % MOD;
  }
  cout << ans << endl;

  return 0;
}