#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll kotae = 0;
const int mod = 1e9 + 7;

vector<int> E[1000001];
int dfs(int p, int d) {
	ll k = 1;
	for (int to : E[p]) {
		k += dfs(to, d + 1);
	}
	kotae += k * d % mod;
	return k;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	int atta[1000001] = {};
	rep(i, N - 1) {
		int a, b;
		cin >> a >> b;
		E[a].pb(b);
		atta[b] = 1;
	}
	int ne = 0;
	rep1(i, N) {
		if (atta[i] == 0) {
			ne = i;
			break;
		}
	}

	dfs(ne, 0);

	co(kotae% mod);



	Would you please return 0;
}