from collections import deque
n,m,k = map(int,input().split())
e = [[] for i in range(n)]
for _ in range(m):
    u,v,c = map(int,input().split())
    e[u-1].append((v-1,c))
    e[v-1].append((u-1,c))
def search(x):
    dis = [k+1]*n
    dis[0] = 0
    q = deque([[0,0]])
    while q:
        now,cost = q.popleft()
        for nex,c in e[now]:
            d = int(c > x)
            if dis[nex] > cost + d:
                dis[nex] = cost+d
                q.append([nex,cost+d]) if d else q.appendleft([nex,cost])
    return dis[-1] < k
l,r = -1,2*10**5
while r > l + 1:
    m = (r+l)//2
    if search(m):
        r = m
    else:
        l = m
print(r)