import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from heapq import *

class RemovableHeap:
    def __init__(self):
        self.hp = []
        self.rem = []
        self.cnt = {}
        self.size = 0
        self.s = 0

    def __len__(self): return self.size

    def __getitem__(self, i):
        assert i == 0
        self.__trim()
        return self.hp[0]

    def push(self, val):
        heappush(self.hp, val)
        self.s += val
        if val in self.cnt: self.cnt[val] += 1
        else: self.cnt[val] = 1
        self.size += 1
        return True

    def pop(self):
        self.__trim()
        assert self.hp
        self.size -= 1
        val = heappop(self.hp)
        self.s -= val
        if self.cnt[val] == 1: del self.cnt[val]
        else: self.cnt[val] -= 1
        return val

    def remove(self, val):
        if val not in self.cnt: return False
        self.size -= 1
        self.s -= val
        if self.cnt[val] == 1: del self.cnt[val]
        else: self.cnt[val] -= 1
        heappush(self.rem, val)
        return True

    def __trim(self):
        while self.rem and self.rem[0] == self.hp[0]:
            heappop(self.hp)
            heappop(self.rem)

def dfs(root):
    hp = RemovableHeap()
    # hp.push(inf)
    st = [root]
    while st:
        u = st.pop()
        for v, c in to[u]:
            if v == par[u]: continue
            par[v] = u
            cc[v] = c
            mns[v] = min(mns[u], c)
            hp.push(-c)
            st.append(v)
    if len(hp) == 0: return 0
    ans = -hp[0]
    st = [(root, 1)]
    while st:
        u, f = st.pop()
        if f:
            if u != root:
                hp.remove(-cc[u])
                if len(hp): ans = min(ans, max(-hp[0], mx-mns[u]))
                else: ans = min(ans, mx-mns[u])
            st.append((u, 0))
            for v, c in to[u]:
                if v == par[u]: continue
                st.append((v, 1))
        else:
            hp.push(-cc[u])
    return ans

n = II()
to = [[] for _ in range(n)]
mx = -1
ru = rv = 0
for i in range(1, n):
    u, v, c = LI1()
    c += 1
    to[u].append((v, c))
    to[v].append((u, c))
    if c > mx: mx, ru, rv = c, u, v

par = [-1]*n
cc = [0]*n
par[ru] = rv
par[rv] = ru
mns = [inf]*n
ans = max(dfs(ru), dfs(rv))
print(ans)