#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

class Centroid {
public:
    Centroid(vector<vector<int>> graph)
        :G(graph), N((int)G.size()), subSize(N, 1) {
    }
    vector<int> operator()() {
        dfs(0, -1);
        return result;
    }
// private:
    vector<vector<int>> G;
    int N;
    vector<int> subSize, result;
    void dfs(int u, int p) {
        bool ok = true;
        for (int v : G[u]) if (v != p) {
            dfs(v, u);
            if (subSize[v] > N / 2)ok = false;
            subSize[u] += subSize[v];
        }
        if (N - subSize[u] > N / 2)ok = false;
        if (ok)result.push_back(u);
    }
};

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

namespace comb {
    const int N = 5010;
    mint fact[N];
    mint rev[N];

    void init() {
        fact[0] = 1;
        for (int i = 1; i < N; ++i)fact[i] = fact[i - 1] * i;
        for (int i = 0; i < N; ++i)rev[i] = fact[i].inverse();
    }

    mint C(int n, int r) {
        if (n < r)return 0;
        return fact[n] * rev[r] * rev[n - r];
    }

    mint H(int n, int r) {
        return C(n + r - 1, r);
    }

    mint P(int n, int r) {
        assert(n >= r);
        return fact[n] * rev[n - r];
    }

    mint catalan(int n) {
        return fact[2 * n] * rev[n + 1] * rev[n];
    }
}

mint dp[5010][5010];

void solve() {
    comb::init();

    int N;
    cin >> N;
    vector<vi> G(N);
    rep(i, N - 1) {
        int u, v;
        cin >> u >> v;
        --u; --v;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    auto centroid = Centroid(G);
    auto vs = centroid();

    if (sz(vs) == 2) {
        mint x = comb::fact[N / 2];
        cout << x * x << endl;
        return;
    }

    int cen = vs[0];
    vi &sub = centroid.subSize;
    vi T;
    each(v, G[cen]) {
        if (sub[v] > sub[cen])T.push_back(N - sub[cen]);
        else T.push_back(sub[v]);
    }

    dp[0][0] = 1;
    int K = sz(T);
    rep(i, K) {
        rep(j, T[i] + 1) {
            for (int k = 0; j + k < N; ++k) {
                auto &z = dp[i + 1][j + k];
                z += dp[i][k] * comb::C(T[i], j)*comb::C(T[i], j)*comb::fact[j];
            }
        }
    }

    mint ans = 0;
    for (int i = 0; i <= N; ++i) {
        mint z = comb::fact[N - i] * dp[K][i];
        if (i % 2)ans -= z;
        else ans += z;
    }
    cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}

Measured memory_bytes: 99328