#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int read()
{
    int 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 << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
int n, u, v, dp[5001][5001], dpp[5001], C[5001][5001], sz[5001], pos, head[10001];
struct edge
{
    int u, v, next;
} e[10001];
void addedge(int u, int v)
{
    e[++pos] = {u, v, head[u]};
    head[u] = pos;
}
void dfs(int u, int fa)
{
    dp[u][1] = 1;
    sz[u] = 1;
    for (int i = head[u]; i; i = e[i].next)
    {
        int v = e[i].v;
        if (v == fa)
            continue;
        dfs(v, u);
        for (int j = 1; j <= sz[u]; j++)
        {
            if (dp[u][j])
            {
                for (int k = j; k <= j + sz[v]; k++)
                {
                    dpp[k] = (dpp[k] + ((dp[u][j] * dp[v][k - j] % MOD) * C[k - 1][j - 1] % MOD)) % MOD;
                }
            }
        }
        sz[u] += sz[v];
        for (int j = 1; j <= sz[u]; j++)
        {
            dp[u][j] = dpp[j];
            dpp[j] = 0;
        }
    }
    for (int j = sz[u]; j >= 0; j--)
    {
        dp[u][j] = (dp[u][j] + dp[u][j + 1]) % MOD;
    }
}
signed main()
{
    n = read();
    for (int i = 1; i < n; i++)
    {
        u = read();
        v = read();
        addedge(u, v);
        addedge(v, u);
    }
    C[0][0] = 1;
    for (int i = 1; i <= n; i++)
    {
        C[i][0] = 1;
        for (int j = 1; j <= i; j++)
        {
            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
        }
    }
    dfs(1, 0);
    printf("%lld\n", dp[1][0] % MOD);
}