#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;

long long N, A[1 << 18], B[1 << 18];
long long dp[1 << 18];
vector<int> X[1 << 18];

void dfs(int pos, int pre) {
	dp[pos] = 1;
	for (int i : X[pos]) {
		if (i == pre) continue;
		dfs(i, pos);
		dp[pos] += dp[i];
	}
}

int main() {
	cin >> N;
	for (int i = 1; i <= N - 1; i++) {
		cin >> A[i] >> B[i];
		X[A[i]].push_back(B[i]);
		X[B[i]].push_back(A[i]);
	}
	dfs(1, -1);

	long long Answer = 0;
	for (int i = 2; i <= N; i++) {
		Answer += 2LL * dp[i] * (N - dp[i]);
	}
	Answer += N * N;
	cout << Answer << endl;
	return 0;
}