#include<bits/stdc++.h>
using namespace std;
const int maxn=5001;
const int mod=1e9+7;
int n;
bool vis[maxn];
vector<int> e[maxn];
inline void view_all(vector<int> &cur,int x,int fa)
{
    cur.push_back(x);
    for(int i=0,p;i<sizeof(e[x]);i++,p=e[x][i])
    {
        if (vis[p]) continue;
        if (p == fa) continue;
        view_all(cur, p, x);
    }
}
inline int calc(int x)
{
    vector<int> cur;
    int ans = 0;
    view_all(cur, x, -1);
    for(int w,i;i<=sizeof(cur);i++,w=cur[i])
    {
        int res = 1;
        vis[w] = 1;
        for(int p,j=0;j<sizeof(e[w]);j++,p=e[w][j])
        {
            if (vis[p]) continue;
            res = 1ll * res * calc(p) % mod;
        }
        vis[w] = 0;
        ans = (ans + res) % mod;
    }
    return ans;
}
int main(){
	long long ans=0;
	cin >> n;
	for(int i=1;i<n;i++){
		int x,y;
		cin >> x >> y;
		e[x].push_back(y);
		e[y].push_back(x);
	}
	for(int i=1;i<=n;i++){
		ans+=calc(i);
		ans%=mod;
	}
	cout<<ans<<endl;
	return 0;
}