#include "bits/stdc++.h"


using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 998244353;

int N;
vector<ll>sz;
ll ans = 0;
void dfs(vector<vector<int>> &G, int v, int p) {
	for (auto nv : G[v]) {
		if (nv == p)continue;
		dfs(G, nv, v);
		ans += (N - sz[nv])*sz[nv];
		sz[v] += sz[nv];
	}
	ans += N;
	ans += (N - sz[v])*sz[v];
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> N;
	vector<vector<int>>G(N);
	for (int i = 0; i < N - 1; i++) {
		int A, B; cin >> A >> B; A--; B--;
		G[A].push_back(B);
		G[B].push_back(A);
	}
	sz.resize(N, 1);
	dfs(G, 0, -1);
	cout << ans << endl;
	return 0;
}