#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX = 200010;
ll inv[MAX],fact[MAX],fi[MAX],mod = 1000000007;
void inverse(){
	int i;
	inv[1] = 1;
	for(i=2;i<MAX;i++){
		inv[i] = mod - (mod/i)*inv[mod%i]%mod;
	}
	fact[0] = fi[0] = 1;
	for(i=1;i<MAX;i++){
		fact[i] = fact[i-1]*i%mod;
		fi[i] = (fi[i-1]*inv[i])%mod;
	}
}

vector<int> G[200010],H[200010];
int dp[200010];
int dfs(int s, int p,int n){
	int ret = 1;
	for(int v:G[s]){
		if(v==p) continue;
		dfs(v,s,n);
		H[s].push_back(dp[v]);
		ret += dp[v];
	}
	dp[s] = ret;
	H[s].push_back(n - ret);
	return ret;
}

ll pw(ll a, ll x){
	ll ret = 1;
	while(x){
		while(!(x&1)){
			(a *= a) %= mod;
			x /= 2;
		}
		x--;
		(ret *= a) %= mod;
	}
	return ret;
}
ll ans = 0;
int main(){
	int i,j,n;
	cin >> n;
	for(i=0;i<n - 1;i++){
		int a,b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	dfs(0,-1,n);
	inverse();
	for(i=0;i<n;i++){
		ll x = inv[2];
		ll y = (1 - pw(inv[2],n - 1) + mod)%mod;
		for(j=0;j<H[i].size();j++){
			ll z = (1 - pw(inv[2],H[i][j]) + mod)%mod;
			(z *= pw(inv[2],n - H[i][j] - 1)) %= mod;
			y -= z;
			y = (y + mod)%mod;
		}
		(ans += x*y%mod) %= mod;
	}
	cout << ans << endl;
}
	