#include <iostream>
#include <vector>
using namespace std;


// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

const int MOD = 1000000007;
using mint = Fp<MOD>;
using Graph = vector<vector<int>>;
int N;
Graph G;
vector<int> size, par;

void rec(int v, int p = -1) {
    par[v] = p;
    for (auto ch : G[v]) {
        if (ch == p) continue;
        rec(ch, v);
        size[v] += size[ch];
    }
}

mint solve() {
    size.assign(N, 1); par.assign(N, -1);
    rec(0);
    mint res = 0;
    for (int v = 0; v < N; ++v) {
        long long sum = 0;
        vector<long long> ss;
        for (auto ch : G[v]) {
            if (ch == par[v]) continue;
            ss.push_back(size[ch]);
            sum += size[ch];
        }
        if (par[v] != -1) ss.push_back(N-1-sum);
        if (ss.size() < 2) continue;

        mint sub = 1;
        for (auto num : ss) sub += modpow(mint(2), num) - 1;
        mint tmp = modpow(mint(2), N-1) - sub;

        //cout << v << ": " << sub << ", " << tmp << endl;

        res += tmp;
    }
    return res / modpow(mint(2), N);
}

int main() {
    while (cin >> N) {
        G.assign(N, vector<int>());
        for (int i = 0; i < N-1; ++i) {
            int x, y; cin >> x >> y; --x, --y;
            G[x].push_back(y); G[y].push_back(x);
        }
        cout << solve() << endl;
    }
}       


Measured memory_bytes: 21632