#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 300100;
const ll mod = 1000000007;

ll n, h[maxn];
vector<int> G[maxn];
vector<ll> f[maxn], g[maxn], cf[2], cg[2];

void dfs(int u, int fa) {
	if (fa != -1) {
		G[u].erase(find(G[u].begin(), G[u].end(), fa));
	}
	for (int v : G[u]) {
		dfs(v, u);
	}
	int o = 0;
	vector<ll>(1, 1).swap(cf[0]);
	vector<ll>(1, 0).swap(cg[0]);
	sort(G[u].begin(), G[u].end(), [&](const int &x, const int &y) {
		return f[x].size() < f[y].size();
	});
	for (int v : G[u]) {
		o ^= 1;
		vector<ll>(1 << (int)f[v].size()).swap(cf[o]);
		vector<ll>(1 << (int)f[v].size()).swap(cg[o]);
		for (int S = 0; S < (int)cf[o ^ 1].size(); ++S) {
			cf[o][S] = (cf[o][S] + cf[o ^ 1][S] * h[v]) % mod;
			cg[o][S] = (cg[o][S] + cg[o ^ 1][S] * h[v]) % mod;
			for (int i = 0; i < (int)f[v].size(); ++i) {
				if (S & (1 << i)) {
					continue;
				}
				cf[o][S | (1 << i)] = (cf[o][S | (1 << i)] + cf[o ^ 1][S] * f[v][i]) % mod;
				if (S > (1 << i)) {
					cg[o][S | (1 << i)] = (cg[o][S | (1 << i)] + cg[o ^ 1][S] * f[v][i]) % mod;
				} else {
					cg[o][S | (1 << i)] = (cg[o][S | (1 << i)] + cf[o ^ 1][S] * g[v][i]) % mod;
				}
			}
		}
	}
	int k = __lg((int)cf[o].size());
	f[u] = g[u] = vector<ll>(k + 1);
	for (int i = 0; i <= k; ++i) {
		int S = (1 << i) - 1;
		h[u] = (h[u] + cf[o][S] + cg[o][S]) % mod;
		f[u][i] = (f[u][i] + cf[o][S]) % mod;
		g[u][i] = (g[u][i] + cf[o][S]) % mod;
		for (int j = 0; j <= i - 2; ++j) {
			g[u][j] = (g[u][j] + cf[o][S ^ (1 << j)] + cg[o][S ^ (1 << j)]) % mod;
		}
	}
	for (int o = 0; o <= 1; ++o) {
		vector<ll>().swap(cf[o]);
		vector<ll>().swap(cg[o]);
	}
}

void solve() {
	scanf("%lld", &n);
	for (int i = 1, u, v; i < n; ++i) {
		scanf("%d%d", &u, &v);
		G[u].pb(v);
		G[v].pb(u);
	}
	dfs(1, -1);
	printf("%lld\n", h[1]);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}