#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int n,a[1000005],dp[1000005],sz[100005];
vector<int>g[1000005];
int ret;
void dfs(int u,int fa){
	for(int v:g[u]){
		if(v==fa)continue;
		dfs(v,u);
		ret=((ret+1ll*dp[u]*sz[v]%mod)%mod+1ll*(dp[v]+sz[v])*sz[u]%mod)%mod;
		sz[u]+=sz[v];
		dp[u]=((dp[u]+dp[v])%mod+sz[v])%mod;
	}
	sz[u]+=u;
	ret=(ret+dp[u]*u%mod)%mod;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n;i++){
		int u,v;scanf("%d%d",&u,&v);
		g[u].push_back(v);g[v].push_back(u);
	}
	dfs(1,-1);
	printf("%d\n",ret);
}