/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.07.03 22:58:21
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) :x((MOD+x)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
vector< vector< int > > g;
vector< mint > child_cnt;
mint ans;
mint par_cnt;
void dfs1(int v) {
    mint cnt = 1;
    for (int u : g[v]) {
        dfs1(u);
        cnt += child_cnt[u];
    }
    child_cnt[v] = cnt;
}
void dfs2(int v) {
    par_cnt += 1;
    for(int u : g[v]) {
        ans += par_cnt * child_cnt[u];
        dfs2(u);
    }
    par_cnt -= 1;
}
int main() {
    int n;
    cin >> n;
    g.resize(n);
    child_cnt.resize(n,0);
    vector< bool > in(n, false);
    int root;
    for (int i = 0; i < n-1; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].push_back(b);
        in[b] = true;
    }
    for (int i = 0; i < n; i++) {
        if (!in[i]) root = i;
    }
    dfs1(root);
    dfs2(root);
    cout << ans << endl;
    return 0;
}