#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, ans, cur;
int h[N], e[N << 1], ne[N << 1], idx;
int sz[N], depth[N];

inline void add(int a, int b) { e[++ idx] = b, ne[idx] = h[a], h[a] = idx; }

// void dfs(int ver, int pre)
// {
//     sz[ver] = ver, sum[ver] = 0;
//     for (int i = h[ver]; ~i; i = ne[i])
//     {
//         int to = e[i];
//         if (to == pre) continue;
//         dfs(to, ver);
//         f[ver] = (f[ver] + sz[to] * sum[ver] % mod + sz[ver] * (sum[to] + sz[to]) % mod) % mod;
//         sum[ver] = (sum[ver] + sum[to] + sz[to]) % mod;
//         sz[ver] += sz[to];
//     }
//     // f[ver] = (f[ver] + ver * sum[ver]) % mod;
// }

void dfs(int ver, int pre)
{
    sz[ver] = ver, depth[ver] = depth[pre] + 1;
    for (int i = h[ver]; ~i; i = ne[i])
    {
        int to = e[i];
        if (to == pre) continue;
        dfs(to, ver);
        sz[ver] += sz[to];
    }
}

void dfs2(int ver, int pre)
{
    for (int i = h[ver]; ~i; i = ne[i])
    {
        int to = e[i];
        if (to == pre) continue;
        int rest = n * (n + 1) / 2 - 2 * sz[to];
        cur = (cur + rest) % mod;
        ans = (ans + cur * to % mod) % mod;
        dfs2(to, ver);
        cur = (cur - rest + mod) % mod;
    }
}

signed main()
{
    memset(h, -1, sizeof h), idx = -1;
    read(n);
    for (int i = 1; i < n; i ++)
    {
        int a, b; read(a, b);
        add(a, b), add(b, a);
    }
    depth[0] = -1;
    dfs(1, 0);
    for (int ver = 1; ver <= n; ver ++) ans += ver * depth[ver];
    cur = ans;
    dfs2(1, 0);
    // cout << ans / 2 << '\n';
    cout << ans * 500000004 % mod << '\n';
    // cout << f[1] << '\n';
    return 0;
}