/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author tatsumack
 */

#include <iostream>
#include <fstream>

#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>

#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>

#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)

using namespace std;

typedef pair<int, int> P;

int mod = 1e9 + 7;

struct mint {
    unsigned x;

    mint() : x(0) {}

    mint(signed sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }

    mint(signed long long sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }

    int get() const { return (int) x; }

    mint& operator+=(mint that) {
        if ((x += that.x) >= mod) x -= mod;
        return *this;
    }

    mint& operator-=(mint that) {
        if ((x += mod - that.x) >= mod) x -= mod;
        return *this;
    }

    mint& operator*=(mint that) {
        x = (unsigned long long) x * that.x % mod;
        return *this;
    }

    mint& operator/=(mint that) { return *this *= that.inverse(); }

    mint operator+(mint that) const { return mint(*this) += that; }

    mint operator-(mint that) const { return mint(*this) -= that; }

    mint operator*(mint that) const { return mint(*this) *= that; }

    mint operator/(mint that) const { return mint(*this) /= that; }

    mint inverse() const {
        long long a = x, b = mod, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            std::swap(a, b);
            u -= t * v;
            std::swap(u, v);
        }
        return mint(u);
    }

    bool operator==(mint that) const { return x == that.x; }

    bool operator!=(mint that) const { return x != that.x; }

    mint operator-() const {
        mint t;
        t.x = x == 0 ? 0 : mod - x;
        return t;
    }
};

mint fact[200005];
class FSurroundedNodes {
public:
    static constexpr int kStressIterations = 0;

    static void generateTest(std::ostream& test) {
    }

    vector<vector<int>> G;
    vector<int> size;
    vector<mint> res;

    int dfs(int v, int p) {
        int s = 1;
        for (auto to : G[v]) {
            if (to == p) continue;
            s += dfs(to, v);
        }
        return size[v] = s;
    }

    void dfs2(int v, int p) {
        mint s = (mint) 1 / mint(2);

        // 全部白
        int sum = 0;
        for (auto to : G[v]) {
            int sz = size[to];
            sum += sz;
        }

        // Sとなる部分木が1つ
        mint tmp2 = 0;
        for (auto to : G[v]) {
            int other = sum - size[to];
            tmp2 += fact[other] * ((mint) 1 - fact[size[to]]);
        }
        res[v] = s * ((mint) 1 - fact[sum] - tmp2);

        int old = size[v];
        for (auto to : G[v]) {
            if (to == p) continue;
            size[v] = sum - size[to] + 1;
            dfs2(to, v);
            size[v] = old;
        }
    }

    void solve(std::istream& cin, std::ostream& cout) {
        int n;
        cin >> n;
        G.resize(n);
        size.resize(n);
        res.resize(n);
        REP(i, n - 1) {
            int a, b;
            cin >> a >> b;
            a--, b--;
            G[a].push_back(b);
            G[b].push_back(a);
        }

        fact[0] = 1;
        fact[1] = mint(1) / mint(2);
        FOR(i, 1, 200001) {
            fact[i+1] = fact[i] / mint(2);
        }

        dfs(0, -1);
        dfs2(0, -1);

        mint ans = 0;
        REP(i, n) ans += res[i];
        cout << ans.get() << endl;
    }
};


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    std::istream& in(std::cin);
    std::ostream& out(std::cout);

    FSurroundedNodes solver;
    solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 20736