#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

template <unsigned int mod>
class ModInt {
private:
    unsigned int v;
    static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
    static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
    static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
    static unsigned int inverse(int a, int m){
        int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
        while(*v){
            t = *u / *v;
            swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
        }
        return (u[1] % m + m) % m;
    }

public:
    ModInt() : v{0}{}
    ModInt(const long long val) : v{norm(val % mod + mod)} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const noexcept { return v != 0; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
    ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
    ModInt operator+() const { return *this; }
    ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
    ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
    ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
    ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
    ModInt operator/(const ModInt& val) const { return *this * inv(val); }
    ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
    ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
    ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
    ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
    ModInt operator+(const long long val) const { return ModInt{v + val}; }
    ModInt operator-(const long long val) const { return ModInt{v - val}; }
    ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
    ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
    ModInt& operator+=(const long long val){ return *this = *this + val; }
    ModInt& operator-=(const long long val){ return *this = *this - val; }
    ModInt& operator*=(const long long val){ return *this = *this * val; }
    ModInt& operator/=(const long long val){ return *this = *this / val; }
    bool operator==(const ModInt& val) const { return v == val.v; }
    bool operator!=(const ModInt& val) const { return !(*this == val); }
    bool operator==(const long long val) const { return v == norm(val % mod + mod); }
    bool operator!=(const long long val) const { return !(*this == val); }
    unsigned int operator()() const { return v; }
    friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
    friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
    friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
    friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
    friend bool operator==(const long long val, const ModInt& n) { return n == val; }
    friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
    friend istream& operator>>(istream& is, ModInt& n){
        unsigned int v;
        return is >> v, n = v, is;
    }
    friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
    friend ModInt mod_pow(ModInt x, long long n){
        ModInt ans = 1;
        while(n){
            if(n & 1) ans *= x;
            x *= x, n >>= 1;
        }
        return ans;
    }
};

#define MOD 1000000007
using mod = ModInt<MOD>;

#define MAX_N 200000
mod inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        inv[i] = MOD - inv[MOD % i] * (MOD / i);
        fac[i] = fac[i-1] * i;
        finv[i] = finv[i-1] * inv[i];
    }
}

mod comb(int a, int b)
{
    if(a<b) return 0;
    return fac[a] * finv[b] * finv[a-b];
}


class centroid {
public:
	int V;
	vector<vector<int> > G;
	vector<int> sz;
	void dfs(int u,int p, vector<int>& ct){
		bool ok = true;
		sz[u] = 1;
		for(int v : G[u]){
			if(v != p){
				dfs(v, u, ct);
				sz[u] += sz[v];
				if(2*sz[v] > V) ok = false;
			}
		}
		if(ok && V <= 2*sz[u]) ct.push_back(u);
	}

	centroid(int node_size) : V(node_size), G(V), sz(V, 0){}
	void add_edge(int u,int v){
		G[u].push_back(v), G[v].push_back(u);
	}
	vector<int> solve(){
		vector<int> ct;
		dfs(0, -1, ct);
		return ct;
	}
};
vector<vector<int> > g;
vector<int> p;
int root;
int dfs(int id,int pre){
    int s = 0;
    for(auto x:g[id]){
        if(x==pre)continue;
        if(id==root){
            p.push_back(dfs(x,id));
        }else{
            s += dfs(x,id);
        }
    }
    return s+1;
}

int main(){
    make();
    int n;
    cin >> n;
    centroid c(n);
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        a--;b--;
        c.add_edge(a,b);
    }
    vector<int> s = c.solve();
    if(s.size()==2){
        mod res = fac[n/2];
        res *= res;
        cout << res << endl;
    }else{
        root = s[0];
        g = c.G;
        dfs(root,-1);
        vector<mod> dp;
        for(auto x:p){
            vector<mod> f(x+1);    
            f[0] = 1;
            rep(i,x){
                f[i+1] = f[i]*(mod)(x-i)*(mod)(x-i)/(mod)(i+1);
            }   
            // cerr << x << endl;
            // rep(i,x+1){
            //     cerr << f[i] << " "; 
            // }
            // cerr << endl;
            if(dp.size()==0){
                dp = f;
            }else{
                int m = f.size() + dp.size();
                vector<mod> dp2(m-1);
                rep(i,f.size()){
                    rep(j,dp.size()){
                        dp2[i+j] += f[i]*dp[j];
                    }
                }
                swap(dp,dp2);
            }
        }
        // cerr << dp.size() << endl;
        for(int i=n-1;i>=0;i--){
            dp[i] *= fac[n-i];
        }
        mod res = 0;
        for(int i=0;i<n;i++){
            if(i%2==0){
                res += dp[i];
            }else{
                res -= dp[i];
            }
        }
        cout << res << endl;
    }
    return 0;
}

Measured memory_bytes: 6276