import sys
input = lambda : sys.stdin.readline().rstrip()

sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))


# グラフの読み込み・重みあり
n,m,k = map(int, input().split())
ns = [[] for _ in range(n)]
mc = 0
for _ in range(m):
    u,v,c = map(int, input().split())
    u -= 1
    v -= 1
    ns[u].append((c,v))
    ns[v].append((c,u))
    mc = max(mc, c)
from collections import deque
def bfs01(start, ns, x):
    n = len(ns)
    dist = [-1]*n
    dist[start] = 0
    q = deque([start])
    while q:
        u = q.popleft()
        if u==n-1:
            break
        d = dist[u]
        for c,v in ns[u]:
            c = int(c>x)
            if c==1:
                if dist[v]==-1:
                    dist[v] = d + 1
                    q.append(v)
            else:
                if dist[v]==-1 or d<dist[v]:
                    dist[v] = d
                    q.appendleft(v)
    return dist[n-1]<=k-1
ng = -1
ok = mc+1
while abs(ok-ng)>1:
    mm = (ok+ng)//2
    if bfs01(0, ns, mm):
        ok = mm
    else:
        ng = mm
ans = ok
print(ans)