#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

#define MOD 1000000007
#define inv2 500000004

std::vector<std::vector<int> > hen;

std::vector<int> subtree_dsum;
void dfs0(int i, int prev) {
	subtree_dsum[i] = inv2;
	for (auto j : hen[i]) if (j != prev) {
		dfs0(j, i);
		subtree_dsum[i] = (subtree_dsum[i] + (int64_t) subtree_dsum[j] * inv2) % MOD;
	}
}

int res = 0;
void dfs1(int i, int prev, int prev_dsum) {
	std::vector<int> all;
	if (prev != -1) all.push_back(prev_dsum);
	for (auto j : hen[i]) if (j != prev) all.push_back(subtree_dsum[j]);
	
	int sum = std::accumulate(all.begin(), all.end(), 0LL) % MOD;
	int sum2 = std::accumulate(all.begin(), all.end(), 0, [] (int a, int b) { return (a + (int64_t) b * b) % MOD; });
	int sum3 = std::accumulate(all.begin(), all.end(), 0, [] (int a, int b) { return (a + (int64_t) b * b % MOD * b) % MOD; });
	
	res = (res
		 + (int64_t) sum * sum % MOD * sum - (int64_t) sum2 * sum * 3 + sum3 * 2 // choose 3 from different arms
		 + ((int64_t) sum * sum - sum2) * 3 // 1 self + 2 from different arms
		 + (int64_t) sum * 3 + 1) % MOD; // 2 self + 1, 3 self
	if (res < 0) res += MOD;
	
	for (auto j : hen[i]) if (j != prev) {
		int next = (int64_t) (sum - subtree_dsum[j] + 1) * inv2 % MOD;
		if (next < 0) next += MOD;
		dfs1(j, i, next);
	}
}

int main() {
	int n = ri();
	hen.resize(n);
	for (int i = 1; i < n; i++) {
		int a = ri() - 1;
		int b = ri() - 1;
		hen[a].push_back(b);
		hen[b].push_back(a);
	}
	subtree_dsum.resize(n);
	dfs0(0, -1);
	
	dfs1(0, -1, 0);
	for (int i = 1; i < n; i++) {
		res += res;
		if (res >= MOD) res -= MOD;
	}
	printf("%d\n", res);
	return 0;
}