#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


vvll g;
vll found; //発見されたフラグ
vvll childCount;

ll dfs(ll parent) { //引数で渡されたノードを親とした部分木に含まれるノード数(親含む)を返す
	//このノードを発見済みに
	found[parent] = 1;

	//このノードの子を探索
	ll count = 1; //自分自身
	for (auto next : g[parent]) {
		if (found[next] > 0) {
			continue; //発見済み＝親
		}

		ll temp = dfs(next);
		childCount[parent].push_back(temp);
		count += temp;
	}

	return count;
}

ll mod_pow(ll x, ll n, ll mod) {
	ll ret = 1;
	while (n > 0) {
		if (n & 1) {
			(ret *= x) %= mod;
		}
		(x *= x) %= mod;
		n >>= 1;
	}
	return ret;
}

int main() {
	ll N;
	cin >> N;
	g.resize(N);
	rep(i, N - 1) {
		ll A;
		cin >> A;
		ll B;
		cin >> B;
		A--;
		B--;
		g[A].push_back(B);
		g[B].push_back(A);
	}
	found.resize(N, 0);
	childCount.resize(N);
	dfs(0); //ノード0を根とする

	//2^iを求めておく
	vmll twoPow(N + 1);
	twoPow[0] = 1;
	reps(i, 1, N) {
		twoPow[i] = twoPow[i - 1] * 2;
	}

	//すべての頂点を走査して、その頂点が穴となるパタン数を計上
	mll sum = 0;
	rep(i, N) {
		mll temp = twoPow[N - 1] - 1;
		ll countNotChild = N - 1;

		for (auto item : childCount[i]) {
			countNotChild -= item;
			temp -= (twoPow[item] - 1);
		}

		temp -= (twoPow[countNotChild] - 1);
		sum += temp;
	}

	mll result = sum / twoPow[N];

	cout << result << endl;

	return 0;
}

Measured memory_bytes: 33920