#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=85,mod=1e9+7;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }return sum;
}
int fac[Maxn],ifac[Maxn];
inline void into(int N){
    fac[0]=ifac[0]=1;
    fr(i,1,N) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N]);
    rf(i,N-1,1) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
}
inline int C(int x,int y){if(x<y || x<0 || y<0) return 0;return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
int n;
vector<int> vc[Maxn];
int siz[Maxn];
int stk[Maxn],ln;
int f[Maxn][Maxn],g[Maxn][Maxn][Maxn][2];
inline int sgn(int x){if(x&1) return mod-1;return 1;}
inline void Trans(){
    memset(g,0,sizeof(g));
    g[0][0][1][0]=g[0][0][1][1]=g[0][1][0][0]=1;
    int now=1;
    fr(i,0,ln-1){
        int nowsiz=siz[stk[i+1]];
        fr(j,0,now) fr(k,0,now-j) if(g[i][j][k][0] || g[i][j][k][1]) {
            fr(l,0,nowsiz){
                if(l==nowsiz){
                    add(g[i+1][j+l][k][0],g[i][j][k][0]);
                    add(g[i+1][j+l][k][1],g[i][j][k][1]);
                }
                fr(d,1,nowsiz-l){
                    int s;
                    s=1ll*fac[nowsiz-l]*C(nowsiz,l)%mod*C(nowsiz-l-1,d-1)%mod;
                    // cout<<s<<endl;
                    s=1ll*s*sgn(nowsiz-l-d)%mod;
                    // cout<<i<<' '<<j<<' '<<k<<' '<<l<<' '<<d<<' '<<s<<endl;
                    add(g[i+1][j+l][k+d][0],1ll*s*C(k+d,d)%mod*g[i][j][k][0]%mod);
                    add(g[i+1][j+l][k+d][1],1ll*s*C(k+d-1,d)%mod*g[i][j][k][1]%mod);
                    if(g[i][j][k][0]){
                        fr(h,1,nowsiz-l-d+1){
                            s=1ll*f[stk[i+1]][nowsiz-h]*C(nowsiz-h,l)%mod;
                            s=1ll*s*fac[nowsiz-l-h]%mod*C(nowsiz-l-h,d-1)%mod*sgn(nowsiz-l-d-h+1)%mod;
                            add(g[i+1][j+l][k+d][1],1ll*s*C(k+d-1,d-1)%mod*g[i][j][k][0]%mod);
                        }
                    }
                    
                }
            }
        }now+=nowsiz;
    }
}
inline void dfs(int x,int fa){
    siz[x]=1;
    for(auto y:vc[x]) if(y!=fa){
        dfs(y,x);
        siz[x]+=siz[y];
    }
    ln=0;
    for(auto y:vc[x]) if(y!=fa) stk[++ln]=y;
    Trans();
    int s=1;
    fr(i,1,ln) s+=siz[stk[i]];
    // cout<<x<<endl;
    // fr(i,0,s) fr(j,1,s) cout<<i<<' '<<j<<' '<<g[ln][i][j][1]<<endl;
    fr(i,0,s) fr(j,1,s) add(f[x][i],g[ln][i][j][1]);
    f[x][s]=1;
}
inline void init(){
    n=read();into(n);
    fr(i,1,n-1){
        int x,y;
        x=read();y=read();
        vc[x].pb(y);vc[y].pb(x);
    }
}
inline void work(){
    dfs(1,0);
    writeln(f[1][0]);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}