#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll ans;
VVI to;
int sz[100100];
int n;
void dfs(int u=0, int p=-1) {
    sz[u] = 1;
    ll x = ll(n - 1) * (n - 1);
    ll t = n - 1;
    for(int v: to[u]) if (v != p) {
        dfs(v, u);
        sz[u] += sz[v];
        t -= sz[v];
        x -= ll(sz[v]) * sz[v];
        ans += 2 * sz[v];
    }
    x -= t * t;
    ans += x;
    ans += 2 * t;
    ans += 1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    to.resize(n);
    rep(_, n - 1) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    dfs();
    cout << ans << endl;
}