//
// Created by 陈基彤 on 2020-01-09.
//
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int maxn = 2e5 + 5;
const LL mod = 1e9 + 7;
vector<int> edge[maxn];
int n;
LL sum[maxn],num[maxn];
LL tt;
void dfs(int x,int fa){
    LL nows = 0,nown = 0,tot = 0;
    for(auto i: edge[x])if(i != fa){
        dfs(i,x);
        tot = (tot + nown*num[i]%mod + nown*sum[i]%mod + num[i]*nows%mod)%mod;
        nows = (nown*sum[i]%mod + num[i]*nows%mod + sum[i]+nows)%mod;
        nown = (nown*num[i]%mod + num[i] + nown)%mod;
    }
    num[x] = (nown * 2 + 1)%mod;
    sum[x] = (nows * 2 + nown)%mod;
    tt = (tt+tot + nows)%mod;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;
    LL inv2 = (mod+1)/2;
//    printf("inv2 is %lld\n",inv2);
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    dfs(1,0);
//    for(int i=1;i<=n;i++)
//        printf("%lld %lld %lld\n",i,num[i],sum[i]);
    tt = (tt%mod + mod)%mod;
//    printf("%lld\n",tt);
    LL dv = 1;
    for(int i=1;i<=n;i++)
        dv = (dv*inv2)%mod;
    cout<<tt*dv%mod<<endl;
    return 0;
}



/*
5
1 2
1 5
2 3
2 4
*/
