from collections import deque
import heapq
N = int(input())
E = [[] for _ in range(N)]
for _ in range(N-1):
    u,v,w = map(int, input().split())
    E[u-1].append((v-1, w))
    E[v-1].append((u-1, w))

q = deque()
q.append((0, 0))
rnk = [-1]*N
rnk[0] = 0
while q:
    temp = q.pop()
    v = temp[0]
    r = temp[1]
    for  e in E[v]:
        if rnk[e[0]] >= 0:
            continue
        rnk[e[0]] = r+1
        q.append((e[0], r+1))

h = []
num = [1]*N
for i in range(N):
    if len(E[i]) == 1:
        heapq.heappush(h, (-rnk[i], i))

used = [0]*N
used[0] = 1
while h:
    temp = heapq.heappop(h)
    v = temp[1]
    used[v] = 1
    for e in E[v]:
        if used[e[0]] == 0:
            num[e[0]] += num[v]
            heapq.heappush(h, (-rnk[e[0]], e[0]))

ans = 0
for i in range(N):
    for e in E[i]:
        n = min(num[i], num[e[0]])
        ans += n*(N-n)*e[1]

print(ans)