#include <bits/stdc++.h>
#define C__ const
#define int long long
using namespace std;
C__ int N_ = 5010, MOD = 1e9 + 7;
int n, a[N_], b[N_];
vector<int> g[N_];
void dfs(int u, int p) {
	a[u] = 1;
	for (int v : g[u]) if (v != p) {
		dfs(v, u);
		(a[u] *= b[v]) %= MOD;
		(b[u] += b[v]) %= MOD;
	}
	(b[u] += a[u]) %= MOD;
}
void change(int u, int p) {
	for (int v : g[u]) if (v != p) {
		(a[v] *= ((b[u] - b[v]) % MOD + MOD) % MOD) %= MOD;
		change(v, u);
	}
}
signed main() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1, 0);
	change(1, 0);
	int ans = 0;
	for (int i = 1; i <= n; i++) (ans += a[i]) %= MOD;
	cout << ans << "\n";
	return 0;
}