#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define Pr(a) (#a)<<"="<<(a)<<" "
#define pr1(a) cerr<<Pr(a)<<endl;
#define pr2(a,b) cerr<<Pr(a)<<Pr(b)<<endl;
#define pr3(a,b,c) cerr<<Pr(a)<<Pr(b)<<Pr(c)<<endl;
#define pr4(a,b,c,d) cerr<<Pr(a)<<Pr(b)<<Pr(c)<<Pr(d)<<endl;
#define pr5(a,b,c,d,e) cerr<<Pr(a)<<Pr(b)<<Pr(c)<<Pr(d)<<Pr(e)<<endl;
#define pr6(a,b,c,d,e,f) cerr<<Pr(a)<<Pr(b)<<Pr(c)<<Pr(d)<<Pr(e)<<Pr(f)<<endl;
#define int long long
#define double long double
using namespace std;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
ostream& operator<<(ostream& o,P p){return o<<"("<<p.first<<","<<p.second<<")";}
istream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}
ostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?" ":"")<<t;return o;}
istream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}
void prArr(auto a,string s=" "){int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}

class Math{
public:
  typedef long long ll;
  ll mod;
  Math(ll mod = 1e9+7):mod(mod){}
  
  
  ll mod_pow(ll a,ll x){
    static unordered_map<int,int> mem;
    if(mem.count(a)) return mem[a];
    int tmp = a;
    ll res=1;
    while(x){
      if(x%2) res=res*a%mod;
      a=a*a%mod;
      x/=2;
    }
    return mem[tmp] = res;
  }

  //逆元
  ll inv(ll a){return mod_pow(a,mod-2);}

  //階乗関数
  ll K(int i, int n = 1e6){
    static vector<ll> k(n);
    if(!k[0]){k[0]=1;for(int i=1;i<(int)k.size();i++)k[i]=i*k[i-1]%mod;}
    return k[i];
  }

  ll nPr(ll n, ll r){return K(n) * inv(K(n-r)) % mod;}

  //O(log(mod))  階上テーブルを使うので、k,rが大きすぎるとダメ。
  ll nCr(ll n,ll r){
    ll a = inv( K(r) * K(n-r) % mod);
    return K(n) * a % mod;
  }

  //O(r + log(mod))
  ll nCr2(ll n,ll r){
    ll N = 1, K = 1; 
    for(int i=0;i<r;i++) N=N*((n-i)%mod)%mod;
    for(int i=0;i<r;i++) K=K*((r-i)%mod)%mod;
    ll R = inv(K);
    return N*R%mod;
  }
  
  /*カーマイケル数ってなんだっけ忘れた*/
  static ll carmichaelLambda(ll n){
    ll res = 1;
    if(n % 8 == 0) n/=2;
    auto lcm = [](ll a,ll b){return (a/__gcd(a,b)) * b;};
    
    auto compute = [&](ll i){
      ll sub = i - 1;
      n/=i;
      while(n%i == 0) n/=i, sub *=i;
      res = lcm(res,sub);
    };
    
    for(int i=2;i*i<=n;i++) if( n % i == 0) compute(i);
    if(n != 1) compute(n);
    return res;
  }

  //n以下の素数を返す。  
  static vector<int> getPrime(int n){
    vector<bool>used(n+1,0);
    
    for(ll i=2;i*i<=n;i++)
      if(!used[i]) for(int j=2;j<=n/i;j++) used[i*j]=1;
    
    vector<int> res;
    for(int i=2;i<=n;i++)if(!used[i]) res.push_back(i);

    return res;
  }
  
  //素数判定
  static bool isPrime(ll n){
    if(n < 2) return 0;
    for(ll i=2;i*i<=n;i++) if(n%i==0) return 0;
    return 1;
  }

  //素因数分解 x == 0 || x == 1のときはその値自身を返す。
  static vector<ll> primeFactor(ll x,int flag = 0){
    if(flag == 0 && (x == 0 || x == 1)) return {x};
    if(flag == 1 && (x == 0 || x == 1)) return {};
    
    vector<ll> res;
    for(ll i=2;i*i <= x;i++)
      while(x%i == 0) x/=i, res.push_back(i);
    if(x != 1) res.push_back(x);
    return res;
  }

  static map<ll,ll> primeFactorMap(ll x,int flag = 0){
    map<ll,ll> res;
    if(flag == 0 && (x == 0 || x == 1)) {res[x]++; return res;}
    if(flag == 1 && (x == 0 || x == 1)) return res;
    
    for(ll i=2;i*i <= x;i++) while(x%i == 0) x/=i, res[i]++;
    if(x != 1) res[x]++;
    return res;
  }
  
  static ll divisor_Sum(map<ll,ll> prime){ // first : prime  second : cnt
    ll res = 1;
    for(P p : prime){
      ll sum = 1, mul = p.first;
      for(ll i=0;i<p.second;i++) sum += mul, mul *= p.first;
      res *= sum;
    }
    return res;
  }
  
  static ll divisor_Sum(ll num){
    return divisor_Sum(primeFactorMap(num));
  }
  
  //約数列挙
  static vector<ll> divisor(ll x){
    vector<ll> res;
    for(ll i=1; i*i<=x ;i++)
      if(x%i==0){
        res.push_back(i);
        if(i*i!=x) res.push_back(x/i);
      }
    sort(res.begin(), res.end());
    return res;
  }

  //a * bがオーバフローするか判定
  static bool overflow(ll a,ll b){return a > LONG_MAX/b;}

};


class TreeSize{
public:
  int V;
  int root;
  vector<vector<int> > G;
  vector<int> w;
  vector<int> sz;
  int ok;
  TreeSize():V(-1){};
  TreeSize(int V,int root = 0):V(V),root(root),G(V),w(V,1),sz(V,0),ok(0){}
  void resize(int n){*this = TreeSize(n);}
  int& operator [](int i){return w[i];}
  
  void add_edge(int a,int b){
    ok = false;
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    G[a].push_back(b);
    G[b].push_back(a);
  }
  
  void build(int root=-1){
    ok = 1;
    if(root != -1) this->root = root;
    dfs(this->root,-1);
  }
  
  int dfs(int pos,int pre = -1){
    sz[pos] = w[pos];
    for(int to:G[pos]) if(to != pre) sz[pos] += dfs(to, pos);
    return sz[pos];
  }
  int size(int i){assert(ok);return sz[i];}
};



class TreeG{
public:
  int V;
  vector<vector<int> > G;
  vector<int> par;
  TreeSize sz;
  int ok;
  TreeG():V(-1){};
  TreeG(int n):V(n),G(V),par(n),sz(V),ok(false){}
  
  void add_edge(int a,int b){
    ok = false;
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    G[a].push_back(b);
    G[b].push_back(a);
    sz.add_edge(a,b);
  }

  void dfs(int pos,int pre){
    par[pos] = pre;
    for(int to: G[pos]) if(to != pre) dfs(to, pos); 
  }
  
  vector<int> get(int root = 0){
    sz.build(root);
    dfs(root,-1);
    
    vector<int> res;
    for(int i=0;i<V;i++){
      int flag = (V - sz.size(i)) <= V/2;
      for(int to:G[i]) if(to != par[i]) flag &= (sz.size(to) <= V/2);
      if(flag) res.push_back(i);  
    }
    assert(!res.empty() && res.size() < 3);
    return res;
  }
};

vector<vector<int> > G;
signed main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Math math;

  int n;
  cin>>n;
  G.resize(n);
  
  TreeG gtree(n);
  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);
    gtree.add_edge(a,b);
  }

  vector<int> g = gtree.get(0);

  if(g.size() == 2){
    int ans = math.K(n/2) * math.K(n/2) % mod;
    cout<<ans<<endl;
    return 0;
  }
  
  vector<int> num;  
  for(int i:g)
    for(int to:G[i]) {
      if(to == gtree.par[i]) num.push_back(n - gtree.sz.size(i));
      else num.push_back(gtree.sz.size(to));
    }
  
  vector<int> dp(vector<int>(n+1,0));
  dp[0] = 1;
  
  for(int i=0;i<(int)num.size();i++){
    vector<int> ndp(n+1,0);
    for(int k=num[i];k>=0;k--){
      int a = math.nCr(num[i], k) * math.nPr(num[i],k) % mod;
      for(int j=n;j>=0;j--){
        if(j + k > n) continue;
        ndp[j + k] += (dp[j] * a) % mod;
        ndp[j + k] %= mod;
      }
    }
    dp = ndp;
  }
  
  
  int ans = 0;
  for(int x=0;x<=n;x++){
    int f = x%2==0? 1:-1;
    ans += f * dp[x] * math.K(n-x);
    ans += mod;
    ans %= mod;
  }

  cout<<ans<<endl;
  
  return 0;
}


Measured memory_bytes: 9472