#include<bits/stdc++.h>
#define int long long
#define endl '\n'
const int MAXN=3e5+5;

int n,dep[MAXN],siz[MAXN];
int s[MAXN],e[MAXN];
int root,minn=INT_MAX,ans1,ans2;
bool vis[MAXN];
std::vector<int> v[MAXN];
void add(int s,int e){v[s].push_back(e);v[e].push_back(s);}

void solve1(int x,int fa){
	int maxn=-1;
	siz[x]=1;
	dep[x]=dep[fa]+1;

	for(int i=0;i<v[x].size();i++)
		if(v[x][i]!=fa){
			solve1(v[x][i],x);
			siz[x]+=siz[v[x][i]];
			maxn=std::max(maxn,siz[v[x][i]]);
		}
	maxn=std::max(maxn,n-siz[x]);
	if(maxn<minn){
		minn=maxn;
		root=x;
	}
}

void solve2(int s){
	std::queue<std::pair<int,int> > q;
	q.push({s,0});
	vis[s]=1;

	while(q.size()){
		int x=q.front().first;
		int w=q.front().second;
		q.pop();
		
		for(int i=0;i<v[x].size();i++)
			if(!vis[v[x][i]]){
				vis[v[x][i]]=1;
				std::pair<int,int> now={v[x][i],w+1};
				ans1+=w+1;
				q.push(now);
			}
	}
}

signed main () {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cin>>n;
	for(int i=1;i<n;i++){
		std::cin>>s[i]>>e[i];
		add(s[i],e[i]);
	}

	solve1(1,0);
	solve2(root);

	for(int i=1;i<n;i++){
		if(dep[s[i]]>dep[e[i]])std::swap(s[i],e[i]);
		ans2+=siz[e[i]]*(n-siz[e[i]])*2;
	}

	std::cout<<ans2-2*ans1<<endl;
	return 0;
}