#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <sstream>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

#define BR "\n"
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define ALL(cont) begin(cont),end(cont)
#define AS_MOD(a, b) ((((a) % (b) ) + (b)) % (b))
#define FEACH(it, cont) for(auto (it) = begin(cont); it!=end(cont);++it)
#define FEACHR(it, cont) for(auto (it) = rbegin(cont); it!=rend(cont);++it)
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define getll() ([](){ll s;scanf("%lld", &s);return s;})()
#define getld() ([](){ld s;scanf("%Lf", &s);return s;})()
#define prl(P) printf("%lld", P)
#define prd(P) printf("%.10Lf", P)
#define pr(P) printf(P)
#define MAX(V, T) V=max(V,T)
#define MIN(V, T) V=min(V,T)

#define DumpArray(cont, from, to) for(int __i=from;__i<to;++__i) {cout<<"(" <<__i<<": " << cont[__i]<<")";} cout<<endl;

/*
 * ***_bound(6)
 * 5 6 6 6 6 6 7 7 7
 *   ^lower    ^upper
 * void reverse(c.begin(), c.end())
 *
 * graph
 * seg tree
 * dp
 * brute force
 */
struct Comparator{
    int operator()(int l, int r) const {
        return r<l;
    }
};
//set<int, Comparator> S;

struct Vec{
    double v[2];
    string to_s(){
        return "("+to_string(v[0])+","+to_string(v[1])+")";
    }
    double& operator[](int t){
        return v[t];
    }
    Vec operator+(Vec t) {
        return {v[0]+t[0],v[1]+t[1]};
    }
    Vec& operator+=(Vec t) {
        v[0]+=t[0];v[1]+=t[1];
        return *this;
    }
    Vec operator-(Vec t) {
        return {v[0]-t[0],v[1]-t[1]};
    }
    Vec& operator-=(Vec t) {
        v[0]-=t[0];v[1]-=t[1];
        return *this;
    }
    Vec operator*(double t) {
        return {v[0]*t,v[1]*t};
    }
    Vec& operator*=(double t) {
        v[0]*=t;v[1]*=t;
        return *this;
    }
    double operator*(Vec t) {
        return v[0]*t[0]+v[1]*t[1];
    }
    Vec operator-(){
        return {-v[0],-v[1]};
    }
    static Vec Z;
};
Vec Vec::Z={0,0};

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef vector<P> VP;
typedef pair<ll,ll> RP;

ll mod=1000*1000*1000+7;
ll powmod(ll a, ll n) {
    ll ret=1;
    ll v=a;
    for(int i=0;(n>>i)>0;++i) {
        if((n>>i)&1==1) ret*=v;
        ret=AS_MOD(ret,mod);
        v*=v;
        v=AS_MOD(v,mod);
    }
    return ret;
}
ll N;
vector<vector<ll> > G;
vector<vector<ll> > S;
vector<bool> visited;
ll dfs(ll p) {
    visited[p]=true;
    ll ret=0;
    for(ll n:G[p]) {
        if (!visited[n]) {
            ll v=dfs(n);
            S[p].pb(v);
            S[n].pb(N-v);
            ret+=v;
        }
    }
    return ret+1;
}
int main() {
    cin >> N;
    G.resize(N);
    S.resize(N);
    visited.resize(N,false);
    REP(i,N-1) {
        ll a,b;
        cin >> a >> b;--a;--b;
        G[a].pb(b);
        G[b].pb(a);
    }
    dfs(0);
    ll x=powmod(2,N);
    ll y=0;
    REP(i,N) {
        ll t=powmod(2,N-1)-1;
        t=AS_MOD(t,mod);
        for(ll v:S[i]) {
            t-=(powmod(2,v)-1);
            t=AS_MOD(t,mod);
        }
        y+=t;
        y=AS_MOD(y,mod);
    }
    ll ans=y*powmod(x,mod-2);
    cout<<AS_MOD(ans,mod)<<endl;
    return 0;
}


Measured memory_bytes: 33792