from collections import deque


n, m, k = map(int, input().split())
G = [[] for i in range(n)]
for _ in range(m):
    u, v, c = map(int, input().split())
    u -= 1; v -= 1
    G[u].append((v, c))
    G[v].append((u, c))
def ok(x):
    Q = deque([0])
    d = [-1] * n
    d[0] = 0
    while Q:
        u = Q.popleft()
        for v, c in G[u]:
            if c > x:
                if d[v] == -1 or (d[u] != -1 and d[v] > d[u] + 1):
                    d[v] = d[u] + 1
                    Q.append(v)
            else:
                if d[v] == -1 or (d[u] != -1 and d[v] > d[u]):
                    d[v] = d[u]
                    Q.appendleft(v)
    return d[-1] < k
l, r = -1, 10 ** 6
while r - l > 1:
    M = (l + r) // 2
    if ok(M):
        r = M
    else:
        l = M
print(r)