from collections import defaultdict, deque


def bsearch(low: int, high: int, fun, is_complement=False) -> int:
    def pred(x: int) -> bool:
        return not fun(x) if is_complement else fun(x)

    lo = low
    hi = high
    res = low
    while lo <= hi:
        m = (lo + hi) // 2
        if pred(m):
            res = max(res, m)
            lo = m + 1
        else:
            hi = m - 1

    return res + 1 if is_complement else res


N, M, K = map(int, input().split())

adj = defaultdict(list)
for _ in range(M):
    u, v, c = map(int, input().split())
    u -= 1
    v -= 1
    adj[u].append((v, c))
    adj[v].append((u, c))


# k 番目にくるカードを m 以下にできるか
def can(m: int) -> bool:
    if m < 0: return False

    q = deque([(0, 0)])
    used = set()
    while q:
        v, step = q.popleft()
        if v == N-1:
            return step < K
        if step >= K: return False
        if v in used: continue
        used.add(v)


        for to, c in adj[v]:
            if to in used: continue
            if c > m:
                q.append((to, step+1))
            else:
                q.appendleft((to, step))

    return False


ans = bsearch(-1, 2*10**5, can, is_complement=True)
print(ans)