#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

#define DEBUG_MODE
#ifdef DEBUG_MODE
#define dump(x) cout << #x << " : " << x << " "
#define dumpL(x) cout << #x << " : " << x << '\n'
#define LINE cout << "line : " << __LINE__ << " "
#define LINEL cout << "line : " << __LINE__ << '\n'
#define dumpV(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << " "
#define dumpVL(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << endl
#define STOP assert(false)
#else
#define dump(x) 
#define dumpL(x) 
#define LINE 
#define LINEL 
#define dumpV(v) 
#define dumpVL(v) 
#define STOP assert(false)
#endif
#define mp make_pair
 
namespace std {
template<class S, class T>
ostream &operator <<(ostream& out, const pair<S, T>& a) {
    out << '(' << a.fi << ", " << a.se << ')';
    return out;
}
}

template <typename T, typename U> T pow_fast(T x, U n) {
    T ret = (T)1;
    while(n) {
        if(n & (U)1) ret *= x;
        x *= x;
        n >>= 1;
    }
    return ret;
}

template <typename ModType, ModType MOD> struct ModInt {
    ModType val;
    ModInt() : val(0) {}
    ModInt(ModType x) : val(x % MOD) {
        if(val < 0) val += MOD;
    };
    operator ModType() const { return val; }
    ModInt &operator+=(const ModInt &m) {
        val += m.val;
        if(val >= MOD) val -= MOD;
        return *this;
    }
    ModInt &operator-=(const ModInt &m) {
        val -= m.val;
        if(val < 0) val += MOD;
        return *this;
    }
    ModInt &operator*=(const ModInt &m) {
        (val *= m.val) %= MOD;
        return *this;
    }
    ModInt &operator/=(const ModInt &m) {
        *this *= m.inverse();
        return *this;
    }
    ModInt operator+(const ModInt &m) const { return ModInt(*this) += m; }
    ModInt operator-(const ModInt &m) const { return ModInt(*this) -= m; }
    ModInt operator*(const ModInt &m) const { return ModInt(*this) *= m; }
    ModInt operator/(const ModInt &m) const { return ModInt(*this) /= m; }
    ModInt inverse() const { return pow_fast(*this, MOD - 2); }
    ModInt pow(ModType n) const {return pow_fast(*this, n); }

    friend std::ostream &operator<<(std::ostream &os, const ModInt &rhs) {
        os << rhs.val;
        return os;
    }
    friend std::istream &operator>>(std::istream &is, ModInt &rhs) {
        ModType value;
        is >> value;
        rhs = ModInt(value);
        return is;
    }
};

using mint = ModInt<ll, MOD>;
int n;
vector<vi> es;

vi size_sub_graph;

int dfs1(int cur, int par) {
    size_sub_graph[cur] = 1;
    for(auto&& to: es[cur]) if(to != par) size_sub_graph[cur] += dfs1(to, cur);
    return size_sub_graph[cur];
}
mint calc(int cur, int par) {
    mint p = mint(1)/mint(2);
    mint ret = 0;
    // 全部白
    mint all_white = 1;
    if(par != -1) {
        all_white *= p.pow(n - size_sub_graph[cur]);
    }
    for(auto&& to: es[cur]) if(to != par) {
        all_white *= p.pow(size_sub_graph[to]);
    }
    //
    mint a_black = 0;
    if(par != -1) {
        a_black += all_white * mint(2).pow(n-size_sub_graph[cur]) * (mint(1) - p.pow(n-size_sub_graph[cur]));
    }
    for(auto&& to: es[cur]) if(to != par) {
        a_black += all_white * mint(2).pow(size_sub_graph[to]) * (mint(1) - p.pow(size_sub_graph[to]));
    }
    if(es[cur].size() == 1) {
        ret = mint(0);
    }
    else {
        ret = p * (mint(1) - (all_white+a_black));
    }
    for(auto&& to: es[cur]) if(to != par) ret += calc(to, cur);
    return ret;
}


int main(){
    cin >> n;
    es.resize(n);
    size_sub_graph.resize(n);
    rep(i, n-1) {
        int a, b;
        cin >> a>> b;
        --a;
        --b;
        es[a].pb(b);
        es[b].pb(a);
    }
    dfs1(0, -1);
    // dumpL(size_sub_graph[0]);
    // cout << flush;
    cout << calc(0, -1) << endl;
    return 0;
}

Measured memory_bytes: 23040