#include<bits/stdc++.h>

#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

/////////////////////////////////////////////////////
#define MOD (ll)(1e9+7)
ll moddiv(ll a,ll b){
    a %= MOD;
    b %= MOD;
    for(ll m=MOD-2;m>0;m/=2){
        if(m&1){
            a=a*b%MOD;
        }
        b=b*b%MOD;
    }
    return a;
}

ll N,M;
vector<ll> abv[202020];
ll mk[202020];
ll umk[202020], dmk[202020];
ll i, j, k, ans;

ll invp2[202020];
const ll inv2 = (MOD + 1) / 2;

ll dfs(ll a,ll p){
    ll i, j;
    if(a!=1&&abv[a].size()==1){
        return 1;
    }

    ll c = 1, d = N - 1;
    c = c + MOD - invp2[N - 1];
    fornum(i,0,abv[a].size()){
        if(abv[a][i]==p)
            continue;
        ll r = dfs(abv[a][i], a);
        c = (c + MOD - invp2[N - 1 - r] * (1 + MOD - invp2[r]) % MOD) % MOD;
        d -= r;
    }
    c = (c + MOD - invp2[N - 1 - d] * (1 + MOD - invp2[d]) % MOD) % MOD;
    //printf("%lld %lld\n", a, c);
    ans += c * inv2;
    ans %= MOD;
    return N-d;
}


int main(){
    scanf("%lld", &N);
    fornum(i,1,N){
        ll a, b;
        scanf("%lld%lld", &a, &b);
        abv[a].push_back(b);
        abv[b].push_back(a);
    }
    invp2[0] = 1;
    fornum(i,0,N){
        invp2[i + 1] = invp2[i] * inv2 % MOD;
    }

    dfs(1, -1);
    printf("%lld", ans);

    return 0;
}