#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD =  1e9+7;
const int N = 2e5;

ll dmod(ll x){
	return x%MOD;
}

ll fe(ll x, ll p){
	if(p == 0) return 1ll;
	if(p == 1) return x;
	ll ret = fe(x,p/2);
	ret = dmod(ret*ret);
	if(p&1) ret = dmod(ret*x);
	return ret;
}

int n;
vector<int> adj[N+5];
ll subt[N+5];

void dfs(int x, int par){
	subt[x] = 1;
	for(int i=0;i<adj[x].size();i++){
		int now = adj[x][i];
		if(now == par) continue;
		dfs(now,x);
		subt[x] += subt[now];
	}
	return;
}

int main(){
	scanf("%lld",&n);
	for(int i=1;i<n;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1,-1);
	ll ans = 0ll;
	for(int i=1;i<=n;i++){
		// atas dan bawah
		ll lol1 = fe(2ll,n-subt[i]);
		ll lol2 = fe(2ll, subt[i]-1);
		ll cur = dmod(dmod( lol1 * lol2 ) - lol1 + MOD - lol2 + MOD + 1);
		
		// bawah dan bawah
		ll tmp = 1ll;
		ll kurang = 0ll;
		for(int j=0;j<adj[i].size();j++){
			int next = adj[i][j];
			if(subt[next] > subt[i]) continue;
			ll kali = fe(2ll, subt[next]);
			tmp = dmod(tmp * kali);
			kurang = dmod(kurang+kali - 1 + MOD);
		}
		cur = dmod(cur + tmp - kurang - 1 + MOD);
		ans = dmod(ans + cur);
	}
	ll bagi = fe(2ll,n);
	bagi = fe(bagi,MOD-2);
	ans = dmod(ans*bagi);
	printf("%lld\n",ans);
	return 0;
}
