#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
const int MOD = 1000000007;
typedef pair<int, int> P;

int N;
vector<int> G[1000010];
vector<P> edges;
int deg[1000010];
int depth[1000010];
int ch[1000010];

int dfs(int v, int pv, int dep) {
    depth[v] = dep;
    int res = 1;
    for (auto& nv:G[v]) {
        if (nv==pv) continue;
        res += dfs(nv, v, dep+1);
    }
    return ch[v] = res;
}
 
signed main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cin >> N;
    rep(i, N-1) {
        int A, B; cin >> A >> B;
        G[A-1].pb(B-1);
        deg[B-1]++;
        edges.pb(P(A-1, B-1));
    }
    
    int root;
    rep(i, N) if (deg[i]==0) root = i;
    dfs(root, -1, 0);
    
    int ans = 0;
    rep(i, N-1) {
        int A = edges[i].first, B = edges[i].second;
        ans += ch[B]*(depth[A]+1);
        ans %= MOD;
    }
    cout << ans << endl;
}