#include<iostream>
#include<vector>
using namespace std;
int N;
vector<int>G[1<<17];
long ans;
int dfs(int u,int p)
{
	ans+=N;
	int ch=0;
	for(int v:G[u])if(v!=p)
	{
		long c=dfs(v,u);
		ans+=c*(N-c);
		ch+=c;
	}
	ans+=(long)(ch+1)*(N-ch-1);
	return ch+1;
}
main()
{
	cin>>N;
	for(int i=1;i<N;i++)
	{
		int a,b;cin>>a>>b;
		a--,b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	dfs(0,-1);
	cout<<ans<<endl;
}