#pragma comment(linker,"/STACK:102400000,102400000")

#include <cstdio>

#include <cstring>

#include <cmath>

#include <iostream>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <stack>

#include <vector>

#include <set>

#include <map>

#define LL long long

#define mod 1000000007

#define inf 0x3f3f3f3f

#define N 100010

#define FILL(a,b) (memset(a,b,sizeof(a)))

using namespace std;

struct edge

{

    int next,v;

    edge(){}

    edge(int v,int next):v(v),next(next){}

}e[N*];

int head[N],tot;

LL num[N],sum,n;

void addedge(int u,int v)

{

    e[tot]=edge(v,head[u]);

    head[u]=tot++;

}

void dfs(int u,int fa)

{

    LL tmp=;

    for(int i=head[u];~i;i=e[i].next)

    {

        int v=e[i].v;

        if(v==fa)continue;

        dfs(v,u);

        num[u]+=num[v];

        tmp+=num[v];

        sum+=num[v]*(n-tmp-);

    }

}

int main()

{

    int u,v;

    while(scanf("%I64d",&n)>)

    {

        tot=;sum=;

        memset(head,-,sizeof(head));

        for(int i=;i<=n;i++)num[i]=;

        for(int i=;i<n;i++)

        {

            scanf("%d%d",&u,&v);

            addedge(u,v);

            addedge(v,u);

        }

        dfs(,-);

        LL total=(n-)*(n-)*n/;

        printf("%I64d\n",total-sum);

    }

}