#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<vector>

 using namespace std;

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

 #define LL long long

 vector<int>g[];

 LL sum[];

 LL tot,N;

 void dfs(int u,int pre){

     sum[u]=;

     LL  res=;

     for(int i=;i<g[u].size();++i){

         if(g[u][i]==pre) continue;

         dfs(g[u][i],u);

         sum[u]+=sum[g[u][i]];

         tot+=res*sum[g[u][i]];

         res+=sum[g[u][i]];

     }

     tot+=res*(N-sum[u]);

 }

 int main()

 {

     while(cin>>N){int u,v;

         tot=;

         for(int i=;i<N;++i){

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

             g[u].push_back(v);

             g[v].push_back(u);

         }

         dfs(,);

         LL tt=;

         LL ans=N*(N-)*(N-)/;

         cout<<ans-tot<<endl;

         for(int i=;i<=N;++i) g[i].clear();

     }

     return ;

 }