#include <bits/stdc++.h>
using namespace std;

#define mod 1000000009
#define MAXN 5005

template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) + (t << 1) + c - '0';c = getchar();} t *= f;}
template <typename T,typename ... Args> inline void read (T &t,Args&... args){read (t);read (args...);}
template <typename T> inline void write (T x){if (x < 0){x = -x;putchar ('-');}if (x > 9) write (x / 10);putchar (x % 10 + '0');}
template <typename T> inline void chkmax (T &a,T b){a = max (a,b);}
template <typename T> inline void chkmin (T &a,T b){a = min (a,b);}

vector <int> g[MAXN];
int n,siz[MAXN],tmp[MAXN],fac[MAXN],ifac[MAXN],f[MAXN][MAXN];
int mul (int a,int b){return 1ll * a * b % mod;}
int dec (int a,int b){return a >= b ? a - b : a + mod - b;}
int add (int a,int b){return a + b >= mod ? a + b - mod : a + b;}
int qkpow (int a,int b){
	int res = 1;for (;b;b >>= 1,a = mul (a,a)) if (b & 1) res = mul (res,a);
	return res;
}
void Add (int &a,int b){a = add (a,b);}
void Sub (int &a,int b){a = dec (a,b);}
int binom (int a,int b){return a >= b ? mul (fac[a],mul (ifac[b],ifac[a - b])) : 0;}

void dfs (int u,int fa){
	siz[u] = 1,f[u][1] = 1;
	for (int v : g[u]) if (v ^ fa){
		dfs (v,u),memset (tmp,0,sizeof (tmp));
		for (int i = siz[v] - 1;~i;-- i) Add (f[v][i],f[v][i + 1]);
		for (int i = 1;i <= siz[u];++ i)
			for (int j = 0;j <= siz[v];++ j)
				Add (tmp[i + j],mul (binom (i + j - 1,i - 1),mul (f[u][i],f[v][j])));
		siz[u] += siz[v];
		for (int i = 1;i <= siz[u];++ i) f[u][i] = tmp[i];
	}
}

signed main(){
	read (n);
	fac[0] = 1;for (int i = 1;i <= n;++ i) fac[i] = mul (fac[i - 1],i);
	ifac[n] = qkpow (fac[n],mod - 2);for (int i = n;i;-- i) ifac[i - 1] = mul (ifac[i],i);
	for (int i = 2,u,v;i <= n;++ i) read (u,v),g[u].push_back (v),g[v].push_back (u);
	dfs (1,0);int ans = 0;for (int i = 1;i <= n;++ i) Add (ans,f[1][i]);
	write (ans),putchar ('\n');
	return 0;
}