#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=1609,Mod=1e9+7;
ll n,tot,eid[N][N],C[N][N],fac[N];
ll stk[N],top,r1,r2,diam=-1;
ll cnt[N][N],dp[2][N][N];
pii es[N<<1];
vector<ll>to[N];
void dfs(ll x,ll f){
    stk[++top]=x;
    if(top-1>diam){
        diam=top-1;
        if(top&1)r1=stk[(top+1)/2],r2=0;
        else r1=stk[top/2],r2=stk[top/2+1];
    }
    for(ll y:to[x]){
        if(y!=f)dfs(y,x);
    }
    top--;
}
void dfs2(ll x,ll f,ll dep,ll*cnt){
    cnt[dep]++;
    for(ll y:to[x]){
        if(y==f)continue;
        dfs2(y,x,dep+1,cnt);
    }
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    n=read();
    rep(i,2,n){
        ll x=read(),y=read();
        es[tot]={x,y},eid[x][y]=tot,tot++;
        es[tot]={y,x},eid[y][x]=tot,tot++;
        to[x].push_back(y);
        to[y].push_back(x);
    }
    ll fl=1;
    rep(i,1,n)fl&=(to[i].size()<=2);
    if(fl){
        ll res=1;
        rep(i,1,n-1)res=res*2%Mod;
        write(res);
        return 0;
    }
    fac[0]=1;
    rep(i,1,n)fac[i]=fac[i-1]*i%Mod;
    rep(i,0,n){
        C[i][0]=1;
        rep(j,1,i)C[i][j]=(C[i-1][j]+C[i-1][j-1])%Mod;
    }
    rep(i,1,n)dfs(i,0);
    rep(i,0,tot-1)dfs2(es[i].second,es[i].first,0,cnt[i]);
    if(!r2){
        for(ll v:to[r1]){
            ll u=eid[v][r1],c=cnt[u][diam/2];
            dp[diam&1][c][u^1]=fac[c];
        }
    }
    else {
        ll u1=eid[r1][r2],u2=u1^1;
        ll c1=cnt[u1][diam/2],c2=cnt[u2][diam/2];
        dp[diam&1][c2][u1]=fac[c2];
        dp[diam&1][c1][u2]=fac[c1];
    }
    per(i,diam-1,1){
        rep(j,1,n){
            rep(k,0,tot-1){
                ll x=es[k].first,y=es[k].second,Dp=dp[(i&1)^1][j][k],cn=cnt[k][i/2];
                if(!Dp)continue;
                dp[(i&1)^1][j][k]=0;
                rep(p,0,cn-1)dp[i&1][cn-p][k^1]=(dp[i&1][cn-p][k^1]+C[j+p-1][j-1]*Dp%Mod*fac[cn])%Mod;
                if(i&1){
                    cn=cnt[k^1][i/2];
                    dp[i&1][cn+j][k]=(dp[i&1][cn+j][k]+Dp*fac[cn])%Mod;
                }
                else {
                    for(ll o:to[y]){
                        ll z=eid[y][o];
                        if(o==x||!cnt[z][i/2-1])continue;
                        ll c1=cnt[k^1][i/2-1];
                        ll c2=cnt[k][i/2]-cnt[z][i/2-1];
                        dp[i&1][j+c1+c2][z]=(dp[i&1][j+c1+c2][z]+C[j+c1+c2][c2]*Dp%Mod*fac[c1]%Mod*fac[c2])%Mod;
                    }
                }
            }
        }
    }
    ll ans=0;
    rep(i,1,n){
        rep(j,0,tot-1)ans=(ans+dp[1][i][j])%Mod;
    }
    write(ans);
    return 0;
}