#include<iostream>
#include<vector>
#include<utility>

using ll = long long;
using Pii = std::pair<int,int>;

const long long mod = 1000000007;

long long dfs(int now,ll dep,std::vector<long long>& deep,std::vector<long long>& des,std::vector<std::vector<long long>>& child){
    deep.at(now) = dep;
    ll res = 1;
    for(int nxt:child.at(now)){
        ll x = 0;
        x = dfs(nxt,dep+1,deep,des,child);
        res += x;
        des.at(now) += x;
    }
    return res;
}

int main(){
    ll n;
    std::cin >> n;
    std::vector child(n,std::vector<ll>());
    std::vector parent(n,true);
    std::vector AB(n-1,Pii());
    for(int i=0; i<n-1; i++){
        ll a,b;
        std::cin >> a >> b;
        AB.at(i) = {a-1,b-1};
        child.at(a-1).push_back(b-1);
        parent.at(b-1) = false;
    }
    int root;
    for(int i=0; i<n; i++){
        if(parent.at(i)){
            root = i;
            break;
        }
    }
    std::vector<ll> deep(n),des(n);
    dfs(root,0,deep,des,child);
    ll ans = 0;
    for(int i=0;i<n-1;i++){
        ll a=AB.at(i).first,b=AB.at(i).second;
        ans += (deep.at(a)+1)*(des.at(b)+1)%mod;
        ans %= mod;
    }
    std::cout << ans << std::endl;
}