#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>

using namespace std;

class Solution {
public:
    int solve(int n, vector<pair<int,int>>& edges) {

        const long long MOD = 1e9 + 7;
        auto norm = [&](long long a) {
            a %= MOD;
            if (a < 0) {
                a += MOD;
            }
            return a;
        };

        auto inverse = [&](long long a) {
            long long b = MOD;
            long long u = 0, v = 1;
            a = norm(a);
            while (a != 0) {
                long long d = b / a;
                b -= d * a;
                u -= d * v;
                swap(a, b);
                swap(u, v);
            }
            return norm(u);
        };

        vector<long long> pow2(n + 1, 1);
        for (int i = 1; i <= n; ++i) {
            pow2[i] = pow2[i - 1] * 2 % MOD;
        }

        vector<vector<int>> graph(n);
        vector<int> pars(n, -1);
        int rt = 0;

        for (auto& e : edges) {
            int u = e.first, v = e.second;
            graph[u].push_back(v);
            graph[v].push_back(u);
        }

        vector<int> sizes(n, 0);
        vector<int> ord;
        ord.push_back(rt);

        for (int i = 0; i < ord.size(); ++i) {
            int u = ord[i];
            for (auto v : graph[u]) {
                if (v == pars[u]) {
                    continue;
                }
                pars[v] = u;
                ord.push_back(v);
            }
        }

        reverse(ord.begin(), ord.end());

        for (auto u : ord) {
            sizes[u] += 1;

            for (auto v : graph[u]) {
                if (v == pars[u]) {
                    continue;
                }
                sizes[u] += sizes[v];
            }
        }

        long long res = 0;
        reverse(ord.begin(), ord.end());
        vector<long long> dp(3, 0);
        vector<long long> ndp(3, 0);
        vector<long long> P(2, 0);
        for (auto u : ord) {
            dp[0] = inverse(pow2[n - sizes[u]]);
            dp[1] = (1 - dp[0] + MOD) % MOD;
            dp[2] = 0;


            for (auto v : graph[u]) {
                if (v == pars[u]) {
                    continue;
                }
                P[0] = inverse(pow2[sizes[v]]);
                P[1] = (1 - P[0] + MOD) % MOD;
                fill(ndp.begin(), ndp.end(), 0);
                for (int i = 2; i >= 0; --i) {
                    for (int j = 0; j < 2; ++j) {
                        int ni = min(2, i + j);
                        ndp[ni] += dp[i] * P[j] % MOD;
                        ndp[ni] %= MOD;
                    }
                }
                swap(dp, ndp);
            }
            res += dp[2] * ((MOD + 1) / 2) % MOD;
            res %= MOD;
        }
        
        return res;
    }
};

int main(int argc, char** argv) {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<pair<int,int>> edges;
    for (int i = 0; i + 1 < n; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        edges.emplace_back(u, v);
    }
    Solution sol;
    cout << sol.solve(n, edges) << "\n";

    return 0;
}

Measured memory_bytes: 17904