#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/timeb.h>
#include <vector>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define chmin(mi, val) mi = min(mi, val)
#define chmax(ma, val) ma = max(ma, val)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
// #define MOD 998244353
#define PI 3.141592653589793238
#define RMAX 4294967295

typedef long long ll;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<Pll> vPll;
typedef vector<Pd> vPd;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<double>> vvd;
typedef vector<vector<Pi>> vvPi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<vector<vector<Pi>>> vvvPi;
typedef vector<vector<vector<vector<Pi>>>> vvvvPi;
typedef priority_queue<int, vector<int>, greater<int>> pqli;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi>> pqlP;
template <class T>
using vec = vector<T>;
template <class T>
using pql = priority_queue<T, vector<T>, greater<T>>;

// vvvvvvvvvvvvvvvvvvvvvvv debug output vvvvvvvvvvvvvvvvvvvvvvv
// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << "," << pair_var.second << ")";
    return os;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
    os << "(" << pair_var.first << "," << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << "(" << itr->first << "," << itr->second << ")";
        itr++;
        if (itr == map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << "  " << *itr << endl;
        itr++;
        if (itr == set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

#define DUMPOUT cerr

void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

// ^^^^^^^^^^^^^^^^^^^^^^^ debug output ^^^^^^^^^^^^^^^^^^^^^^^

string YN(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "YES" : "NO");
}
string yn(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "Yes" : "No");
}
string ON(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "OK" : "NG");
}

int dir4[4][2] = {{0, -1}, {-1, 0}, {1, 0}, {0, 1}};
int dir8[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0},
                  {1, 0},   {-1, 1}, {0, 1},  {1, 1}};
char dirchar[4] = {'<', '^', '>', 'v'};

// [a,b)
int irand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_int_distribution<int> dist(a, b - 1);
    return dist(Rand);
}

// [a,b)
double drand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_real_distribution<double> dist(a, b);
    return dist(Rand);
}

// https://qiita.com/IgnorantCoder/items/3101d6276e9bdddf872c
template <typename A, typename F>
inline auto transform(const A &v, F &&f) {
    using result_type =
        decltype(std::declval<F>()(std::declval<typename A::value_type>()));
    vector<result_type> y(v.size());
    std::transform(std::cbegin(v), std::cend(v), std::begin(y), f);
    return y;
}

// 多次元vector生成
template <class T>
vector<T> make_v(size_t size, const T &init) {
    return vector<T>(size, init);
}
template <class... Ts>
auto make_v(size_t size, Ts... rest) {
    return vector<decltype(make_v(rest...))>(size, make_v(rest...));
}

template <typename T>
T max(vector<T> a) {
    return *max_element(all(a));
}
template <typename T>
T min(vector<T> a) {
    return *min_element(all(a));
}
template <typename T>
T sum(vector<T> a) {
    return accumulate(all(a), (T)0);
}

// mapでカウントとかする
template <typename T>
void add(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
        m[item] = 1;
    } else {
        m[item]++;
    }
}

// デフォルト値つきのmapのget
template <typename T, typename U>
U get(map<T, U> m, T key, U def) {
    if (m.find(key) == m.end()) {
        return def;
    } else {
        return m[key];
    }
}

template <typename T>
bool contains(set<T> t, const T &key) {
    return t.find(key) != t.end();
}

template <typename T, typename U>
bool contains(map<T, U> t, const T &key) {
    return t.find(key) != t.end();
}

struct Edge {
    int from, to, cost;
    bool operator<(Edge e) {
        return cost < e.cost;
    }
};

using Graph = vec<vec<Edge>>;
ostream &operator<<(ostream &os, Edge &edge) {
    os << "(" << edge.from << "->" << edge.to << ":" << edge.cost << ")";
    return os;
}

//======================================================

vector<int> Centroid(const Graph &G) {
    int n = G.size();
    vector<int> centroid;
    vector<int> sz(n);
    function<void(int, int)> dfs = [&](int u, int prev) {
        sz[u] = 1;
        bool is_centroid = true;
        for (auto v : G[u])
            if (v.to != prev) {
                dfs(v.to, u);
                sz[u] += sz[v.to];
                if (sz[v.to] > n / 2) is_centroid = false;
            }
        if (n - sz[u] > n / 2) is_centroid = false;
        if (is_centroid) centroid.push_back(u);
    };
    dfs(0, -1);
    return centroid;
}

class FactorialMod {
    // モジュラ逆数を求める(modが素数と仮定)
    void ModInv() {
        inv[0] = 0;
        inv[1] = 1;
        for (int i = 2; i <= n; i++) {
            inv[i] = mod - ((mod / i) * inv[mod % i] % mod);
        }
    }

    // n!をmodで割った余り
    void FacInv() {
        fac[0] = facinv[0] = 1;
        for (int i = 1; i <= n; i++) {
            fac[i] = (fac[i - 1] * i) % mod;
            facinv[i] = (facinv[i - 1] * (int)inv[i]) % mod;
        }
    }

  public:
    int n;
    int mod;
    vector<long long> inv;
    vector<long long> fac;
    vector<long long> facinv;

    FactorialMod(int _n, int _mod)
        : n(_n), mod(_mod), inv(vector<long long>(_n + 1)),
          fac(vector<long long>(_n + 1)), facinv(vector<long long>(_n + 1)) {
        ModInv();
        FacInv();
    }

    ll CombiMod(int r, int k) {
        if (r == 0 && k == 0) return 1;
        if (r <= 0 || k < 0 || k > r) return 0;
        if (k == 0) return 1;

        return (((fac[r] * facinv[k]) % mod) * facinv[r - k]) % mod;
    }
};

vi subtree_size(const Graph &G, int c) {
    int n = G.size();
    vector<int> sz;
    function<int(int, int)> dfs = [&](int u, int prev) {
        int sum = 1;
        for (auto v : G[u])
            if (v.to != prev) {
                int s = dfs(v.to, u);
                sum += s;
                if (u == c) sz.push_back(s);
            }
        return sum;
    };

    dfs(c, -1);

    return sz;
}

int main(void) {
    int N;
    cin >> N;
    Graph G(N);
    rep(i, N - 1) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        G[x].push_back(Edge{x, y, 1});
        G[y].push_back(Edge{y, x, 1});
    }
    auto centroid = Centroid(G);
    dump(centroid);
    FactorialMod fm(N, MOD);

    if (centroid.size() == 2) {
        cout << (fm.fac[N / 2] * fm.fac[N / 2]) % MOD << endl;
        return 0;
    }

    auto t = subtree_size(G, centroid[0]);
    dump(t);

    int K = t.size();

    vvll dp(K + 1, vll(N, 0));
    dp[0][0] = 1;

    rep(i, K) {
        rep(x, N + 1) {
            rep(y, t[i] + 1) {
                if (x + y <= N - 1) {
                    dp[i + 1][x + y] +=
                        ((dp[i][x] * fm.CombiMod(t[i], y) % MOD) *
                         fm.CombiMod(t[i], y) % MOD) *
                        fm.fac[y] % MOD;
                    dp[i + 1][x + y] %= MOD;
                }
            }
        }
    }

    dump(dp);

    ll ans = 0;
    rep(x, N) {
        ll d = (fm.fac[N - x] * dp[K][x]) % MOD;
        if (x % 2 == 0) {
            ans += d;
        } else {
            ans += MOD - d;
        }
        ans %= MOD;
    }
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 196352