import sys
rr = sys.stdin

N,M,K = map(int,rr.readline().split())
G = [[] for _ in range(N+1)]
for _ in range(M):
    a,b,c = map(int,rr.readline().split())
    G[a].append((b,c))
    G[b].append((a,c))

import heapq
inf = 10 ** 6
base = 23
mask = (1 << base) - 1
"""
def calc(x):
    dist = [K] * (N+1)
    dist[1] = 0
    q = [1]
    while q:
        u = heapq.heappop(q)
        d,now = u >> base,u & mask
        if now == N:break
        if dist[now] < d:
            continue
        for v,c in G[now]:
            if c > x:
                c = 1
            else:
                c = 0
            if dist[v] > d + c:
                dist[v] = d + c
                heapq.heappush(q,(d+c) << base | v)
    return dist[N] < K
"""
from collections import deque
def calc(x):
    dist = [-1] * (N+1)
    dist[1] = 0
    q = deque([1])
    while q:
        now = q.popleft()
        for v,c in G[now]:
            if dist[v] >= 0:continue
            if c > x:
                dist[v] = dist[now] + 1
                q.append(v)
            else:
                dist[v] = dist[now]
                q.appendleft(v)
    return dist[N] < K
start = -1
end = 2 * 10 ** 5
while end - start > 1:
    mid = (end + start) // 2
    if calc(mid):
        end = mid
    else:
       start = mid
print(end)