def bfs(x):
    Q=deque([x])
    X=[-1]*(N+1); X[x]=0
    while Q:
        x=Q.popleft()
        for y in F[x]:
            if X[y]==-1:
                X[y]=X[x]+1
                Q.append(y)
    return X

import sys
from collections import deque
N,M,K=map(int,input().split())
E=[]
F=[[] for _ in range(N+1)]
for _ in range(M):
    u,v,c=map(int,input().split())
    E.append((u,v,c))
    F[u].append(v)
    F[v].append(u)

E.append((1,1,0))
F[1].append(1)

Y=bfs(N)

E.sort(key=lambda t:t[2])
for u,v,c in E:
    if min(Y[u],Y[v])<K:
        exit(print(c))