// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 5e3 + 5;
const int MOD = 1e9 + 7;

LL fpm(LL base, LL exp)
{
    LL ret = 1;
    for (; exp; exp >>= 1) {
        if (exp & 1)
            (ret *= base) %= MOD;
        (base *= base) %= MOD;
    }
    return ret;
}

int N;
vector<int> G[MAXN];

void input()
{
    read(N);
    for (int i = 1; i < N; ++i) {
        int u, v;
        read(u); read(v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
}

int size[MAXN];
int cnt, centroid;

void dfs(int u, int f)
{
    int max = 0;
    size[u] = 1;
    for (int i = 0; i < SZ(G[u]); ++i) {
        int v = G[u][i];
        if (v != f) {
            dfs(v, u);
            size[u] += size[v];
            chkmax(max, size[v]);
        }
    }
    chkmax(max, N - size[u]);
    if (max * 2 <= N) {
        ++cnt;
        centroid = u;
    }
}

void solve()
{
    static LL fac[MAXN], ifac[MAXN];

    fac[0] = 1;
    for (int i = 1; i <= N; ++i) {
        fac[i] = fac[i - 1] * i % MOD;
    }
    ifac[N] = fpm(fac[N], MOD - 2);
    for (int i = N; i >= 1; --i) {
        ifac[i - 1] = ifac[i] * i % MOD;
    }

    dfs(1, 0);
    if (cnt == 2) {
        printf("%lld\n", fac[N / 2] * fac[N / 2] % MOD);
        return;
    }
    dfs(centroid, 0);

    static LL f[MAXN][MAXN];

    f[0][0] = 1;
    for (int i = 0; i < SZ(G[centroid]); ++i) {
        int sz = size[G[centroid][i]];
        LL coef = 1;
        for (int j = 0; j <= sz; ++j) {
            for (int k = 0; j + k <= N; ++k) {
                f[i + 1][j + k] = (f[i + 1][j + k] + f[i][k] * coef) % MOD;
            }
            coef = coef * (sz - j) % MOD * fpm(j + 1, MOD - 2) % MOD * (sz - j) % MOD;
        }
    }

    LL ans = 0;
    for (int i = 0; i <= N; ++i) {
        ans = (ans + (i & 1 ? -1 : 1) * f[SZ(G[centroid])][i] % MOD * fac[N - i]) % MOD;
    }
    (ans += MOD) %= MOD;

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();
}

// 莫愁前路无知己，天下谁人不识君。
//     -- 高适《别董大二首》


Measured memory_bytes: 196096