#include <bits/stdc++.h>
using namespace std;

const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
    a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
    a = a*b % MOD;
}

int main(){
    int N;
    cin >> N;
    static vector<int> edges[1000000];
    vector<bool> in(N);
    for(int i=0; i<N-1; i++){
        int a, b;
        cin >> a >> b;
        edges[a-1].push_back(b-1);
        in[b-1] = true;
    }
    int R = -1;
    for(int i=0; i<N; i++) if(!in[i]) R = i;

    int64_t ans = 0;
    auto dfs = [&](auto&& dfs, int i, int64_t d)->int{
        int res = 1;
        for(int j : edges[i]){
            int low = dfs(dfs, j, d+1);
            add(ans, d*low);
            res += low;
        }
        return res;
    };
    dfs(dfs, R, 1);
    cout << ans << endl;
    return 0;
}