#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 998244353;
const ll INF = 1e16;

ll n;
vvl G;
vl sz;  // sz[v] : vの部分木のサイズ
ll ans = 0;

void dfs(ll v, ll p = -1) {
    if(p != -1 && G[v].size() == 1) {
        ans += n;
    }
    for(ll u : G[v]) {
        if(u == p) { continue; }
        dfs(u, v);
        sz[v] += sz[u];
    }
}

int main() {
    
    cin >> n;    
    
    G.resize(n);
    rep(i, n-1) {
        ll a, b;
        cin >> a >> b;
        a--;  b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    
    sz.assign(n, 1);
    dfs(0);

    rep(v, n) {
        ans += sz[v] * (2*n + 1 - 2*sz[v]);
    }

    out(ans);
    re0;
}