#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;

inline int read()
{
	int x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
	return w==1?x:-x;
}

ll n,b[maxn],siz[maxn],tot,ans;
vector <int> mp[maxn];
const ll mod=1000000007;

inline ll pw(ll a,ll b)
{
	ll ans=1,base=a;
	while(b)
	{
		if(b&1) ans=(ans*base)%mod;
		base=(base*base)%mod; b>>=1;
	}
	return ans;
}

inline void dfs1(int u,int fa)
{
	siz[u]=1;
	for(int i=0;i<mp[u].size();i++)
	{
		int v=mp[u][i]; if(v==fa) continue;
		dfs1(v,u); siz[u]+=siz[v];
	}
}

inline void dfs2(int u,int fa)
{
	ll p=0;
	for(int i=0;i<mp[u].size();i++)
	{
		int v=mp[u][i]; if(v==fa) continue;
		p=(p+b[siz[v]]-1)%mod; dfs2(v,u);
	}
	if(fa!=0) p=(p+b[n-siz[u]]-1)%mod; tot=(tot+p)%mod;
}

int main()
{
	n=read(); rep(i,1,n-1){int u=read(),v=read(); mp[u].pb(v); mp[v].pb(u);}
	b[0]=1; rep(i,1,n) b[i]=(b[i-1]*2)%mod;
	dfs1(1,0); dfs2(1,0);
	ans=(n*b[n-1]-n+mod)%mod; ans=(ans-tot+mod)%mod;
	ans=(ans*pw(b[n],mod-2))%mod; cout<<ans<<endl;
	return 0;
}