#include <algorithm>
// #include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int MOD = 1000000007;
// const int MOD = 998244353;

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(long long exponent) {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &rhs) { if((val += rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &rhs) { if((val += mod - rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &rhs) { val = static_cast<unsigned long long>(val) * rhs.val % mod; return *this; }
  ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); }
  bool operator==(const ModInt &rhs) const { return val == rhs.val; }
  bool operator!=(const ModInt &rhs) const { return val != rhs.val; }
  bool operator<(const ModInt &rhs) const { return val < rhs.val; }
  bool operator<=(const ModInt &rhs) const { return val <= rhs.val; }
  bool operator>(const ModInt &rhs) const { return val > rhs.val; }
  bool operator>=(const ModInt &rhs) const { return val >= rhs.val; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; }
  ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; }
  ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; }
  ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; }
  friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; }
  friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; }
private:
  ModInt inv() const {
    // if (__gcd(val, mod) != 1) assert(false);
    unsigned a = val, b = mod; int x = 1, y = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(x -= tmp * y, y);
    }
    return ModInt(x);
  }
};
int abs(const ModInt &x) { return x.val; }
struct Combinatorics {
  int val;
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) {
    if (n < 0 || k < 0) return ModInt(0);
    return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
  }
};

using CostType = long long;
struct Edge {
  int src, dst; CostType cost;
  Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}
  inline bool operator<(const Edge &rhs) const {
    return cost != rhs.cost ? cost < rhs.cost : dst != rhs.dst ? dst < rhs.dst : src < rhs.src;
  }
  inline bool operator<=(const Edge &rhs) const { return cost <= rhs.cost; }
  inline bool operator>(const Edge &rhs) const {
    return cost != rhs.cost ? cost > rhs.cost : dst != rhs.dst ? dst > rhs.dst : src > rhs.src;
  }
  inline bool operator>=(const Edge &rhs) const { return cost >= rhs.cost; }
};

vector<int> centroid(const vector<vector<Edge> > &graph) {
  int n = graph.size();
  vector<int> subtree(n, 1);
  vector<int> res;
  function<void(int, int)> dfs = [&](int par, int ver) {
    bool is_centroid = true;
    for (const Edge &e : graph[ver]) {
      if (e.dst != par) {
        dfs(ver, e.dst);
        subtree[ver] += subtree[e.dst];
        is_centroid &= subtree[e.dst] <= n / 2;
      }
    }
    if (is_centroid && (n - subtree[ver]) <= n / 2) res.emplace_back(ver);
  };
  dfs(-1, 0);
  sort(ALL(res));
  return res;
}

int main() {
  int n; cin >> n;
  Combinatorics com(n);
  vector<vector<Edge> > graph(n);
  REP(_, n - 1) {
    int x, y; cin >> x >> y; --x; --y;
    graph[x].emplace_back(x, y);
    graph[y].emplace_back(y, x);
  }
  vector<int> centroids = centroid(graph);
  ModInt ans = 0;
  if (centroids.size() == 2) {
    ans += com.fact[n / 2] * com.fact[n / 2];
  } else {
    int cen = centroids[0];
    vector<int> subtree(n, 1);
    function<void(int, int)> dfs = [&](int par, int ver) {
      for (const Edge &e : graph[ver]) {
        if (e.dst != par) {
          dfs(ver, e.dst);
          subtree[ver] += subtree[e.dst];
        }
      }
    };
    dfs(-1, cen);
    vector<int> cnt;
    for (const Edge &e : graph[cen]) cnt.emplace_back(subtree[e.dst]);
    int m = cnt.size();
    vector<vector<ModInt> > dp(m + 1, vector<ModInt>(n + 1, 0));
    dp[0][0] = 1;
    REP(i, m) REP(j, n + 1) {
      for (int k = 0; k <= cnt[i] && j + k <= n; ++k) {
        dp[i + 1][j + k] += dp[i][j] * com.nCk(cnt[i], k) * com.nCk(cnt[i], k) * com.fact[k];
      }
    }
    REP(j, n + 1) ans += dp[m][j] * (j & 1 ? -1 : 1) * com.fact[n - j];
  }
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 98560