#include<bits/stdc++.h>

using namespace std;

void dfs(int v, int pre, vector<vector<int>>& g, vector<long long>& ch, long long &ans){
    for(auto nv : g[v]){
        if(nv == pre) continue;
        dfs(nv, v, g, ch, ans);
        ch[v] += ch[nv];
    }
    
}

void dfs2(int v, int pre, vector<vector<int>>& g, vector<long long>& ch, long long &ans){
    for(auto nv : g[v]){
        if(nv == pre) continue;
        dfs2(nv, v, g, ch, ans);
    }

    long long sum = 0;
    for(auto nv : g[v]){
        if(nv == pre) continue;
        sum += ch[nv] - 1;
    }

    long long n = (long long)(g.size());
    if(pre != -1){
        sum += n - ch[v] - 1;
    }

    long long minus = 0;
    for(auto nv : g[v]){
        if(nv == pre) continue;
        minus += (sum - ch[nv] + 1) * (ch[nv] - 1);
    }
    if(pre != -1){
        minus += (sum - (n - ch[v] - 1)) * (n - ch[v] - 1);
    }
    ans -= minus / 2;

}

int main(){
    long long n;
    cin >> n;
    vector<vector<int>> g(n);
    for(int i = 0;i < n-1;i++){
        int u, v;
        cin >> u >> v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    long long ans = n*(n-1) / 2;
    vector<long long> ch(n, 1);
    dfs(0, -1, g, ch, ans);
    dfs2(0, -1, g, ch, ans);
    cout << ans << endl;
}