import sys
input = sys.stdin.readline
from collections import deque
class Tree:
  def __init__(self, N):
    self.V = N
    self.edge = [[] for _ in range(N)]
    self.order = []
  
  def add_edges(self, ind=1, bi=True):
    for i in range(self.V-1):
      a,b = map(int, input().split())
      a -= ind; b -= ind
      self.edge[a].append(b)
      if bi: self.edge[b].append(a)

  def add_edge(self, a, b, bi=True):
    self.edge[a].append(b)
    if bi: self.edge[b].append(a)

  def dp(self, start):
    global ans
    stack = deque([start])
    self.parent = [self.V]*self.V; self.parent[start] = -1
    self.order.append(start)
    #記録したい値の配列を定義
    self.dp = [1]*self.V
    while stack:
      v = stack.pop()
      for u in self.edge[v]:
        if u==self.parent[v]: continue
        self.parent[u]=v
        stack.append(u); self.order.append(u)
    for v in self.order[::-1]:
      cum = 0
      for u in self.edge[v]:
        if u==self.parent[v]: continue
        ans += (self.dp[u]+1) * (N-self.dp[u])
        cum += self.dp[u]
        self.dp[v] += self.dp[u] #帰りがけ処理
      ans += (cum+1) * (N-cum)

N = int(input())
G = Tree(N)
G.add_edges(ind=1, bi=True)
ans = 0
G.dp(0)
print(ans)