#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

using Tree = vector<vector<int>>;

ll dfs(int v, int p, int d, const Tree &G, vector<ll> &childs,
       vector<ll> &depth) {
    ll num = 1;
    depth[v] = d;
    if(G[v].size() == 0) {
        return childs[v] = 1;
    }
    for(auto nv : G[v]) {
        if(nv == p)
            continue;
        num += dfs(nv, v, d + 1, G, childs, depth);
    }
    return childs[v] = num;
}

template <uint_fast64_t MOD> class ModInt {
    using u64 = uint_fast64_t;

  public:
    u64 val;

    ModInt(const u64 x = 0) : val(x % MOD) {}
    constexpr u64 &value() { return val; }
    constexpr ModInt operator-() { return val ? MOD - val : 0; }
    constexpr ModInt operator+(const ModInt &rhs) const {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt &rhs) const {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt &rhs) const {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt &rhs) const {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt &operator+=(const ModInt &rhs) {
        val += rhs.val;
        if(val >= MOD) {
            val -= MOD;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &rhs) {
        if(val < rhs.val) {
            val += MOD;
        }
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &rhs) {
        val = val * rhs.val % MOD;
        return *this;
    }

    constexpr ModInt &operator/=(const ModInt &rhs) {
        *this *= rhs.inv();
        return *this;
    }

    constexpr bool operator==(const ModInt &rhs) { return this->a == rhs.a; }
    constexpr bool operator!=(const ModInt &rhs) { return this->a != rhs.a; }
    friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
        return os << x.val;
    }
    friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
        return is >> x.val;
    }

    constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); }

    constexpr ModInt pow(ll e) const {
        u64 x = 1, p = val;
        while(e > 0) {
            if(e % 2 == 0) {
                p = (p * p) % MOD;
                e /= 2;
            } else {
                x = (x * p) % MOD;
                e--;
            }
        }
        return ModInt(x);
    }
};

int main() {
    int N;
    cin >> N;
    vector<pii> edges(N - 1);
    Tree G(N);
    vector<bool> is_root(N, true);
    rep(i, N - 1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        edges[i] = MP(a, b);
        G[a].pb(b);
        is_root[b] = false;
    }
    int root = 0;
    rep(i, N) {
        if(is_root[i]) {
            root = i;
            break;
        }
    }
    vector<ll> childs(N), depth(N);
    dfs(root, -1, 1, G, childs, depth);
    using mint = ModInt<MOD>;
    mint res = 0;
    rep(i, N - 1) {
        ll m = childs[edges[i].second];
        res += mint(m * (depth[edges[i].first]));
    }
    cout << res << endl;
    return 0;
}