#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define mod 1000000007
using namespace std;

int N;
int u, v;
vector<int> E[1000006];
long long ans = 0, dp[1000006];
int fa[1000006];
long long siz[1000006];

inline void erg(int u, int dep){
	dp[1] += 1LL * u * dep;
	dp[1] %= mod;
	siz[u] = u;
	for (auto && v : E[u]){
		if (v == fa[u]) continue;
		fa[v] = u;
		erg(v, dep + 1);
		siz[u] += siz[v];
		siz[u] %= mod;
	}
}

inline void dfs(int u){
	ans += u * dp[u];
	ans %= mod;
	for (auto && v : E[u]){
		if (v == fa[u]) continue;
		dp[v] = dp[u];
		dp[v] -= siz[v];
		dp[v] += (siz[1] - siz[v]);
		dp[v] = (dp[v] % mod + mod) % mod;
		dfs(v);
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d", &N);
	for (int i = 1; i < N; i ++){
		scanf("%d %d", &u, &v);
		E[u].push_back(v);
		E[v].push_back(u);
	}
	erg(1, 0);
	dfs(1);
	ans %= mod;
	ans = (ans * ((mod + 1) / 2)) % mod;
	printf("%lld\n", ans % mod);

	return 0;
}