import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

tree = [[] for _ in range(N)]

for _ in range(N-1):
	u, v, w = MAP()
	tree[u-1].append((v-1, w))
	tree[v-1].append((u-1, w))

root = 0

size_d = [0]*N
parent = [0]*N
order = []
stack = [root]
while stack:
    x = stack.pop()
    order.append(x)
    for y, w in tree[x]:
        if y == parent[x]:
            continue
        parent[y] = x
        stack.append(y)

for v in order[::-1]:
    size_d[v] += 1
    p = parent[v]
    s = size_d[v]
    size_d[p] += s

ans = 0
q = deque([root])
while q:
    n = q.popleft()
    for node, w in tree[n]:
        if node == parent[n]:
            continue
        ans += w*size_d[node]*(N-size_d[node])*2
        q.append(node)
print(ans)