#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

ll res;
vec sz;
void dfs(int p, int v, mat &G){
    sz[v] = 1;
    for(int to : G[v]){
        if(to != p){
            dfs(v, to, G);
            res += sz[to] * (N - sz[to]);
            sz[v] += sz[to];
        }
    }
    if(p != -1){
        res += (N - sz[v]) * sz[v];
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N;
    mat G(N);
    rep(i, N - 1){
        int a, b;
        cin>>a>>b; --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    res = N * N;
    sz.resize(N);
    dfs(-1, 0, G);
    cout<<res<<endl;
}