#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;

template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

int main() {
	i64 n; scanf("%lld", &n);
	std::vector<int> a(n - 1), b(n - 1);
	std::vector<std::vector<int>> g(n);
	for(int i = 0; i < n - 1; i++) {
		scanf("%d%d", &a[i], &b[i]); a[i]--; b[i]--;

		g[a[i]].push_back(b[i]);
		g[b[i]].push_back(a[i]);
	}

	i64 ans = 0;
	auto solve = [&](auto&& solve, int v, int par) -> i64 {
		i64 ret = 0, sum = 0;
		for(auto to: g[v]) {
			if(to == par) continue;
			i64 val = solve(solve, to, v);
			ans += val - val * val;
			sum += val;
		}
		ans += (n - (sum + 1)) - (n - (sum + 1)) * (n - (sum + 1));
		ans += (n - 1) * (n - 1) + n;
		return sum + 1;
	};
	solve(solve, 0, -1);

	printf("%lld\n", ans);
	return 0;
}