// clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcountll
#define ffs __builtin_ffsll
#define ctz __builtin_ctzll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define all(a) (a).begin(), (a).end()

using namespace std;
using namespace __gnu_pbds;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using pll = pair<ll,ll>;
template <typename T> using vec = vector<T>;
using vi = vec<int>;
using vl = vec<ll>;
template <typename T> using que = queue<T>;
template <typename T> using deq = deque<T>;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V> using ordered_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T> T id(T b) {return b;};
template <typename T> void chmax(T &x, T y) {if (x < y) x = y;}
template <typename T> void chmin(T &x, T y) {if (x > y) x = y;}
template <typename S, typename K> bool contains(S &s, K k) { return s.find(k) != s.end(); }
template <typename T> bool getf(T flag, size_t i) { return (flag>>i) & 1; }
template <typename T> T setf(T flag, size_t i) { return flag | (T(1)<<i); }
template <typename T> T unsetf(T flag, size_t i) { return flag & ~(T(1)<<i); }
void fastio() { ios_base::sync_with_stdio(false); cin.tie(nullptr); }
constexpr ll TEN(int n) { if (n == 0) return 1LL; else return 10LL*TEN(n-1); }
// clang-format on

struct edge {
    int to, cost;
    edge(int to, int cost)
        : to(to), cost(cost) { }
};

using elem = pii;

const int INF = TEN(8);

int main() {
    fastio();

    int n, m, k;
    cin >> n >> m >> k;
    vec<vec<edge>> g(n);
    forn(i, m) {
        int x, y, c;
        cin >> x >> y >> c;
        x--, y--;
        g[x].emplace_back(y, c);
        g[y].emplace_back(x, c);
    }

    int l = -1, r = 200000;
    while (r - l > 1) {
        int m = (l + r) / 2;

        priority_queue<elem, vec<elem>, greater<elem>> q;
        q.emplace(0, 0);
        vec<int> dist(n, INF);

        while (!q.empty()) {
            auto [x, i] = q.top();
            q.pop();

            if (dist[i] < x) {
                continue;
            }

            for (auto [j, c] : g[i]) {
                int y = x + (c > m ? 1 : 0);
                if (dist[j] > y) {
                    dist[j] = y;
                    q.emplace(y, j);
                }
            }
        }

        if (dist[n - 1] < k) {
            r = m;
        } else {
            l = m;
        }
    }

    cout << r << endl;

    return 0;
}