#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 1e18;
const ll fact_table = 5000000;
double Pi = 3.1415926535897932384626;
 
vector<ll> G[550010];
vector<ll> R[550010];
vector<pair<ll, double> > tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<"\n";
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 
 
//ll mod = 998244353;
ll mod = 1000000007;
 
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,a,b,c,d,e,f,g,h,w,i,j,q,r,l;
ll k,ans;
ll x[500005],y[500005],z[500005];
ll dp[5005][5005];
char s[500005];
char t[500005];
bool used[500005];
ll size[500005];
vector<ll> first[500005], final[500005];

void dfs_prop(ll v, ll p){
    // final[p] からsize[v]を取り除く
    // size[p] からsize[v]を引き算してそれを新たに加える
    // それをfinalに格納すれば良い
    bool removed = false;
    vector<ll> vec;
    /*
    for(ll i=0;i<final[p].size();i++){
        if(final[p][i] == size[v] && !removed){
            removed = true;
            continue;
        }else{
            vec.pb(final[p][i]);
        }
    }
    */
    ll new_son = n - size[v];
    vec.pb(new_son);
    for(ll i=0;i<first[v].size();i++){
        vec.pb(first[v][i]);
    }
    final[v] = vec;
    for(ll i=0;i<G[v].size();i++){
        ll nv = G[v][i];
        if(nv == p)continue;
        dfs_prop(nv, v);
    }
    return;
}

ll dfs_size(ll v, ll p){
    ll cnt = 1;
    vector<ll> vec;
    for(ll i=0;i<G[v].size();i++){
        ll nv = G[v][i];
        if(nv == p)continue;
        ll a = dfs_size(nv, v);
        cnt += a;
        vec.pb(a);
    }
    size[v] = cnt;
    first[v] = vec;
    return cnt;
}

vector<ll> dfs(ll v, ll p){
    vector<ll> vec;
    ll cnt = 1;
    for(ll i=0;i<G[v].size();i++){
        ll nv = G[v][i];
        if(nv == p)continue;
        ll a = dfs_size(nv, v);
        cnt += a;
        vec.pb(a);
    }
    size[v] = cnt;
    return vec;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin >> n;
    for(ll i=0;i<n-1;i++){
        cin >> a >> b;
        G[a].pb(b);
        G[b].pb(a);
    }
    first[1] = final[1] = dfs(1, -1);
    for(ll i=0;i<G[1].size();i++){
        ll nv = G[1][i];
        dfs_prop(nv, 1);
    }
    ll ans = 0;
    for(ll i=1;i<=n;i++){
        ll onewhite = 0;
        if(final[i].size() == 1){
            onewhite += rui(2, final[i][j]);
        }else{
            onewhite ++;
            for(ll j=0;j<final[i].size();j++){
                onewhite += rui(2, final[i][j]) - 1;
                onewhite %= mod;
            }
        }
        onewhite = mod - onewhite;
        onewhite += rui(2, n - 1);
        onewhite %= mod;
        ans += onewhite;
        ans %= mod;
    }
    ans *= rui(rui(2, n), mod - 2);
    ans %= mod;
    p(ans);
    return 0;
}















Measured memory_bytes: 102784