#include<iostream>
#include<vector>
using namespace std;
long mod=1e9+7;
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int N;
vector<int>G[2<<17];
long ans=0;
pair<long,long>dfs(int u,int p)
{
	vector<pair<long,long> >X;
	for(int v:G[u])
	{
		if(v!=p)
		{
			pair<long,long>p=dfs(v,u);
			X.push_back(p);
		}
	}
	if(X.empty())
	{
		return make_pair(0L,1L);
	}
	long sum=0;
	long prod=1;
	long w[3]={1,0,0};
	for(pair<long,long>p:X)
	{
		prod=prod*(p.second+1)%mod;
		w[2]=(w[2]*(p.second+1)+w[1]*p.second)%mod;
		w[1]=(w[1]+w[0]*p.second)%mod;
	}
	for(pair<long,long>p:X)
	{
		long now=prod*power(p.second+1,mod-2)%mod;
		sum+=now*p.first%mod+(now-1)*p.first%mod;
		sum=(sum%mod+mod)%mod;
	}
	sum+=w[2];sum%=mod;
	(ans+=sum)%=mod;
	pair<long,long>ret=make_pair(sum,(prod+prod-1+mod)%mod);
	for(pair<long,long>p:X)
	{
		(ret.first+=p.first+p.second)%=mod;
	}
	return ret;
}
int main()
{
	cin>>N;
	for(int i=1;i<N;i++)
	{
		int u,v;cin>>u>>v;
		u--,v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	dfs(0,-1);
	cout<<ans*power(power(2,N),mod-2)%mod<<endl;
}
