#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
vector<int> e[5005];
int dp[5005][5005];
int sz[5005];
const int mod=1e9+7;
int tmp[5005];
//i 子树挖掉大小为 j 的连通块，剩下的所有方案乘起来总数.
bool vis[5005];
void dfs(int x,int f){
	vis[x]=1;
	int sp=0;
	for(auto v:e[x]){
		if(v==f)continue;
		sp++;
	}
	if(!sp){
		sz[x]=1;
		dp[x][0]=1;
		dp[x][1]=1;
		return;
	}
	sz[x]=1;
	dp[x][1]=1;
	for(auto v:e[x]){
		if(v==f)continue;
		dfs(v,x);
		for(int i=0;i<=sz[x]+sz[v];i++)tmp[i]=0;
		for(int i=0;i<=sz[v];i++){
			for(int j=1;j<=sz[x];j++){
				tmp[i+j]+=dp[v][i]*dp[x][j]%mod;
				tmp[i+j]%=mod;
			}
		}
		for(int i=0;i<=sz[x]+sz[v];i++)dp[x][i]=tmp[i];
		sz[x]+=sz[v];
	}
	for(int i=1;i<=sz[x];i++)dp[x][0]+=dp[x][i]*i%mod,dp[x][0]%=mod;
}
signed main(){
	cin>>n;
	if(n==1){cout<<1<<"\n";return 0;}
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		e[u].push_back(v),e[v].push_back(u);
	}
	dfs(1,0);
	int res=0;
	for(int i=1;i<=n;i++)res+=dp[1][i]*i%mod;
	cout<<res%mod<<"\n";
	return 0;
}