#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

llint n;
vector<llint> G[1000005];
bool used[1000005];
llint ans;

llint dfs(int v, llint d)
{
	llint ret = 1;
	for(int i = 0; i < G[v].size(); i++){
		ret += dfs(G[v][i], d+1);
	}
	ans += ret * d % mod, ans %= mod;
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	llint u, v;
	for(int i = 1; i <= n-1; i++){
		cin >> u >> v;
		G[u].push_back(v);
		used[v] = true;
	}
	
	llint root;
	for(int i = 1; i <= n; i++){
		if(!used[i]) root = i;
	}
	
	dfs(root, 0);
	cout << ans << endl;
	
	return 0;
}