// Problem: B. 8.4t4
// Contest: undefined - NOIP2024训练赛 03
// URL: http://119.28.3.174/contest/1155/problem/2715
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, INF = 0x3f3f3f3f;

const int mod=1e9+7;
const int maxn=5005;
bool vis[maxn];
vector<int> e[maxn];
int n;
inline void view_all(vector<int> &cur,int x,int fa)
{
    cur.push_back(x);
    for(int p : e[x])
    {
        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(auto w : cur)
    {
        int res = 1;
        vis[w] = 1;
        for(auto p: e[w])
        {
            if (vis[p]) continue;
            res = 1ll * res * calc(p) % mod;
        }
        vis[w] = 0;
        ans = (ans + res) % mod;
    }
    return ans;
}
inline int get_ans()
{
    return calc(1);
}

// int n, m, q, ans;
// int s[N], dp[N];

// vector<int> e[N];

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1; i < n; i ++)
	{
		int u, v; cin >> u >> v;
		e[u].push_back(v), e[v].push_back(u);
		
	}
	cout << get_ans() << '\n';
	return 0;
}