#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-5)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E &b) const { return cost < b.cost; }
bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
vector<string>split(string s, char c = ' ') {
	vector<string>vec;
	string h = "";
	for (int i = 0; i < s.size();) {
		int j = i;
		while (j < s.size() && s[j] != ' ') {
			h += s[j++];
		}
		if (h.size() > 0) vec.push_back(h);
		h = "";
		i = j + 1;
	}
	return vec;
}
template<typename T>
void print_vec(vector<T>a) {
	for (int i = 0; i < a.size(); i++) {
		cout << (i == 0 ? "" : " ") << a[i];
	}
	cout << endl;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int n;
vector<int>e[200000];
int dp[200000][2];
//i以下の頂点をiを白/黒で塗り分ける方法
H b[200000];
H c[200000];
signed main() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u = read(), v = read();
		e[u].push_back(v);
		e[v].push_back(u);
	}
	for (int i = 1; i <= n; i++) b[i] = H{ Inf,i };
	queue<int>q;
	q.push(1);
	b[1].x = 0;
	while (!q.empty()) {
		int t = q.front(); q.pop();
		c[t].x = b[t].x;
		for (int i = 0; i < e[t].size(); i++) {
			if (b[e[t][i]].x > b[t].x + 1) {
				b[e[t][i]].x = b[t].x + 1;
				q.push(e[t][i]);
			}
		}
	}
	sort(b + 1, b + n + 1);
	for (int z = n; z > 0; z--) {
		int t = b[z].y;
		int res = 1, sum = 1;
		for (int i = 0; i < e[t].size(); i++) {
			if (c[e[t][i]].x > c[t].x) {
				res *= dp[e[t][i]][0];
				sum *= dp[e[t][i]][0] + dp[e[t][i]][1];
				res %= Mod;
				sum %= Mod;
			}
		}
		dp[t][1] = res;
		dp[t][0] = sum;
	}
	cout << (dp[1][0] + dp[1][1]) % Mod << endl;
}

Measured memory_bytes: 18548