n,m,k=map(int,input().split())
from collections import deque
g=[[] for _ in range(n)]
for _ in range(m):
    a,b,c=map(int,input().split())
    g[a-1].append((b-1,c))
    g[b-1].append((a-1,c))
def bfs(x):
    dst=[float('inf')]*n
    dst[0]=0
    q=deque()
    q.append((0,0))
    while q:
        now,d=q.popleft()
        if now==n-1:break
        if dst[now]<d:continue
        for to,num in g[now]:
            if num>x:
                if dst[to]>d+1:
                    dst[to]=d+1
                    q.append((to,d+1))
            else:
                if dst[to]>d:
                    dst[to]=d
                    q.appendleft((to,d))
    return dst[n-1]
ok=2*10**5
ng=-1
while ok-ng>1:
    mid=(ok+ng)//2
    if bfs(mid)<k:
        ok=mid
    else:
        ng=mid
print(ok)