import sys
input = sys.stdin.readline

N, M, K = map(int, input().split())
Edge = []
for i in range(M):
    u, v, c = map(int, input().split())
    u, v = u - 1, v - 1
    Edge.append((u, v, c))

from collections import *
def check(m):
    G = [[] for i in range(N)]
    for u, v, c in Edge:
        if c > m:
            G[u].append((v, 1))
            G[v].append((u, 1))
        else:
            G[u].append((v, 0))
            G[v].append((u, 0))

    Q = deque()
    inf = 10 ** 18
    dist = [inf] * N
    dist[0] = 0
    Q.append(0)
    while Q:
        u = Q.popleft()
        for v, c in G[u]:
            if dist[v] <= dist[u] + c:
                continue
            dist[v] = dist[u] + c
            if c == 0:
                Q.appendleft(v)
            else:
                Q.append(v)

    return dist[-1] < K


if check(0):
    print(0)
    exit()

yes = 2 * 10 ** 5 + 5
no = 0
while yes - no != 1:
    mid = (yes + no)//2
    if check(mid):
        yes = mid
    else:
        no = mid

print(yes)