import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()

Graph = [[] for _ in range(N+1)]
for _ in range(N-1):
    A,B = MI()
    Graph[A].append(B)
    Graph[B].append(A)

sub_tree = [-1]*(N+1)


def f(i,p):
    res = 1
    for j in Graph[i]:
        if j != p:
            res += f(j,i)
    sub_tree[i] = res
    return res


f(1,0)

ans = N**2
for i in range(1,N+1):
    s = sub_tree[i]
    X = [N-s]
    for j in Graph[i]:
        t = sub_tree[j]
        if t < s:
            X.append(t)
    for x in X:
        ans += (N-x)*x

print(ans)