#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5 + 5, mod = 1e9 + 7;
int T[maxn], n;
vector<int> vec[maxn], UPF[maxn], DOWF[maxn];
//UPF:µ½faµÄ±ßÊÇÎÒ×Ô¼º´«ÉÏÈ¥
//DOWF:µ½faµÄ±ßÊÇfa´«ÏÂÀ´ 
void add(int &x, int y) {
	x += y;
	if(x >= mod) x -= y;
}
void dfs(int now, int f) {
	for(int v : vec[now]) if(v != f) dfs(v, now);
	sort(vec[now].begin(), vec[now].end(), [&](int a, int b) {return UPF[a].size() < UPF[b].size();});
	int sz = 1;
	vector<int> UP(2), DOW(2);
	UP[0] = 1;
	//UP:¶ù×ÓÈ«²¿ÏòÉÏ´«
	//DOW:ÎÒÏòÏ´«ÁË 
	for(int v : vec[now]) {
		if(v == f) continue;
		vector<int> F(1 << UPF[v].size() + 1), G(1 << UPF[v].size() + 1);
		//F:¶Ô±êUP
		//G:¶Ô±êDOW 
		for(int S = 0;S < sz;S ++) {
			add(F[S], 1ll * UP[S] * T[v] % mod);
			add(G[S], 1ll * DOW[S] * T[v] % mod);
			for(int x = 0;x < UPF[v].size();x++) {
				if(S >> x & 1) continue;
				add(F[S | (1 << x)], 1ll * UPF[v][x] * UP[S] % mod);
				if(S > (1 << x)) add(G[S | (1 << x)], 1ll * UPF[v][x] * DOW[S] % mod);
				else add(G[S | (1 << x)], 1ll * DOWF[v][x] * UP[S] % mod);
			}
		}
//		cout << now << " " << v << " " << T[v] << '\n';
//		for(int X : G) cout << X << " ";
//		cout << '\n';
		swap(F, UP), swap(G, DOW);
		
//		cout << now << " " << v << " " << UPF[v].size() << '\n'; 
		sz = (1 << UPF[v].size());
		vector<int>().swap(F), vector<int>().swap(G); 
	}
//	cout << now << '\n';
//	for(int X : DOW) cout << X << " ";
//	cout << '\n';
//	cout << now << " " << sz << " " << log2(sz) + 1 << '\n' ;
	sz = log2(sz);
	UPF[now].resize(sz + 1), DOWF[now].resize(sz + 1);
	for(int i = 0;i <= sz;i++) {
		int S = (1 << i) - 1;
		add(T[now], UP[S]), add(T[now], DOW[S]);
//		cout << now << " " << i << " " << S << " " << UP[S] << '\n';
		add(UPF[now][i], UP[S]), add(DOWF[now][i], UP[S]);
		for(int j = 0;j <= i - 2;j++) add(DOWF[now][j], (UP[S ^ (1 << j)] + DOW[S ^ (1 << j)]) % mod);
	}
//	cout << now << " " << DOWF[now][0] << '\n';
	while(!UPF[now].back() && !DOWF[now].back()) UPF[now].pop_back(), DOWF[now].pop_back();
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1, u, v;i < n;i++) {
		cin >> u >> v;
		vec[u].push_back(v), vec[v].push_back(u);
	}
	dfs(1, 0);
	cout << T[1] << '\n';
}