n = int(input())
edges = []

for _ in range(n - 1):
    u, v, w = map(int, input().split())
    edges.append((w, u, v))

edges.sort(reverse=True)

parent = [i for i in range(n + 1)]
size = [1] * (n + 1)
sum_weight = [0] * (n + 1)

def find(u):
    if parent[u] != u:
        parent[u] = find(parent[u])
    return parent[u]

def union(u, v, w):
    pu = find(u)
    pv = find(v)
    if pu == pv:
        return
    if size[pu] < size[pv]:
        pu, pv = pv, pu
    parent[pv] = pu
    size[pu] += size[pv]
    sum_weight[pu] += sum_weight[pv] + w

result = edges[0][0]

for w, u, v in edges:
    pu = find(u)
    pv = find(v)
    if pu != pv:
        union(u, v, w)
        result = max(result, sum_weight[find(u)])

print(result)