#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T, T Div = 2> constexpr T INFTY = std::numeric_limits<T>::max() / Div;

template <class T> bool setmin(T& lhs, const T& rhs) {
    if (lhs > rhs) {
        lhs = rhs;
        return true;
    }
    return false;
}

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N, M, K;
    std::cin >> N >> M >> K;
    Vec<Vec<std::pair<usize, i32>>> graph(N);
    for (const auto i : rep(0, M)) {
        usize u, v;
        i32 c;
        std::cin >> u >> v >> c;
        u -= 1;
        v -= 1;
        graph[u].emplace_back(v, c);
        graph[v].emplace_back(u, c);
    }
    const auto check = [&](const i32 threshold) {
        Vec<usize> dist(N, INFTY<usize>);
        std::deque<usize> que;
        dist[0] = 0;
        que.push_back(0);
        while (!que.empty()) {
            const auto u = que.front();
            que.pop_front();
            for (const auto& [v, c] : graph[u]) {
                if (c > threshold) {
                    if (setmin(dist[v], dist[u] + 1)) {
                        que.push_back(v);
                    }
                } else {
                    if (setmin(dist[v], dist[u])) {
                        que.push_front(v);
                    }
                }
            }
        }
        return dist[N - 1] < K;
    };
    i32 ok = 200000, ng = -1;
    while (ok - ng > 1) {
        const auto md = (ok + ng) / 2;
        (check(md) ? ok : ng) = md;
    }
    std::cout << ok << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}