#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
 
using namespace std;
 
///////////////////////////////////////////////////////////////////////////////
 
#define DEBUG 0
 
#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)
 
#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
 
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;
 
///////////////////////////////////////////////////////////////////////////////
 
template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}
 
template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}
 
void llin(ll &a)
{
    CIN(a);
}
 
void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}
 
void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}
 
void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}
 
void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}
 
void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}
 
template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}
 
template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}
 
template <typename T>
void _debug_print(T x)
{
    cout << x << endl;
}
 
void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}
 
void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
 
void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}
 
template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}
 
template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}
 
template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}
 
template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}
 
void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}
 
 
 
void make_parental_relation(const V<ll> edgelist[], ll root, ll n,
                            ll parents[], V<ll> children[], ll levels[])
{
    queue<ll> q;
    bool checked[n+1];
 
    memset(checked, 0, sizeof(checked));
 
    q.push(root);
    checked[root] = true;
    parents[root] = root;
    levels[root] = 0LL;
 
    for ( ; !(q.empty()); ) {
        ll now = q.front(); q.pop();
        for (auto next : edgelist[now]) {
            if (checked[next]) continue;
            q.push(next);
            checked[next] = true;
            parents[next] = now;
            children[now].pb(next);
            levels[next] = levels[now] + 1LL;
        }
    }
}
 
 
void make_edgelist(const V<t2> &srclist, V<ll> edgelist[])
{
    for (auto src : srclist) {
        ll a = get<0>(src);
        ll b = get<1>(src);
        edgelist[a].pb(b);
        edgelist[b].pb(a);
    }
}
 
 
 
 
#define MOD   (1000000007LL)
// #define MOD   (998244353LL)
 
ll mod_mlt(ll x, ll y, ll mod)
{
    ll ret = 0LL;
    x %= mod;
 
    while (y) {
        if (y & 1LL) {
            ret += x;
            ret %= mod;
        }
        y >>= 1;
        x <<= 1;
        x %= mod;
    }
 
    return ret;
}
 
// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod)
{
    ll ret = 1LL;
 
    for ( ; exp; ) {
        if (exp & 1LL) {
            ret *= base;
            ret %= mod;
        }
        base = (base * base) % mod;
        exp >>= 1;
    }
 
    return ret;
}
 
// O(log(mod))
ll mod_inv(ll x, ll mod)
{
    // available only when mod is prime
    return mod_pow(x, mod - 2LL, mod);
}
 
ull mod_combination(ll x, ll y, ll mod)
{
    if (y > x / 2LL) y = x - y;
 
    ll ret = 1;
 
    for (ll i = 0LL; i < y; ++i) {
        ret = (ret * x--) % mod;
        ret = (ret * mod_inv(i + 1LL, mod)) % mod;
    }
 
    return ret;
}
 
void make_perms(ll perms[], ll perm_invs[], ll size, ll mod)
{
    perms[0] = 1LL;
    srep (i, 1, size) {
        perms[i] = perms[i-1] * i;
        perms[i] %= mod;
    }
 
    perm_invs[size-1] = mod_inv(perms[size-1], mod);
    rrep (i, size-1) {
        perm_invs[i] = perm_invs[i+1LL] * (i+1LL);
        perm_invs[i] %= mod;
    }
}
 
 
 
 
///////////////////////////////////////////////////////////////////////////////
 
void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
 
    _main();
    return 0;
}
 
void _main()
{
    ll n; llin(n);
    V<t2> uvlist; llinl2(uvlist, n-1);
 
    S V<ll> edgelist[200005];
    make_edgelist(uvlist, edgelist);
 
    S ll parents[200005];
    S V<ll> children[200005];
    S ll levels[200005];
    make_parental_relation(edgelist, 1, n, parents, children, levels);
 
    S ll cnts[200005];
    S ll ccnts[200005];
    S queue<ll> q;
    srep (v, 1, n+1) {
        ccnts[v] = children[v].size();
        cnts[v] = 1;
        if (children[v].empty()) q.push(v);
    }
 
    while (q.size()) {
        ll v = q.front(); q.pop();
        if (v == 1) continue;
        ll pv = parents[v];
        cnts[pv] += cnts[v];
        ccnts[pv]--;
        if (!ccnts[pv]) q.push(pv);
    }
 
    debug_printf("---- cnts\n");
    debug_print(cnts, n+1);
 
    S ll pows[200005];
    pows[0] = 1;
    rep (i, 200003) {
        pows[i+1] = pows[i] * 2LL;
        pows[i+1] %= MOD;
    }
 
    ll ans = 0;
 
    srep (v, 1, n+1) {
        ll cnt = pows[n-1];
        ll decr = pows[n-cnts[v]] - 1LL;
        if (decr < 0) decr += MOD;
        for (auto cv : children[v]) {
            decr += (pows[cnts[cv]] - 1LL);
            if (decr < 0) decr += MOD;
            decr %= MOD;
        }
        decr++;
        decr %= MOD;
        debug_printf("v=%lld cnt=%lld decr=%lld\n", v, cnt, decr);
        cnt -= decr;
        if (cnt < 0) cnt += MOD;
        ans += cnt;
        ans %= MOD;
    }
 
    ans *= mod_inv(pows[n], MOD);
    ans %= MOD;
 
    debug_printf("---- ans\n");
    cout << ans << endl;
}

Measured memory_bytes: 36172