#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <deque>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll INF = 1e+15;

typedef pair<ll, int> P;

struct edge{
    int to;
    ll cost;
};

vector<ll> dijkstra(int s, vector<vector<edge>> G){
    deque<P> que;
    int n = G.size();
    vector<ll> d(n, INF);
    d[s] = 0;
    que.push_back(P(0, s));
    while(!que.empty()){
        P p = que.front();que.pop_front();
        int v = p.second;
        if(d[v] < p.first) continue;
        for(int i = 0; i < G[v].size(); i++){
            edge e = G[v][i];
            if(d[v] + e.cost < d[e.to]){
                d[e.to] = d[v] + e.cost;
                if(e.cost == 0) que.push_front(P(d[e.to], e.to));
                else que.push_back(P(d[e.to], e.to));
            }
        }
    }
    return d;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m, k; cin >> n >> m >> k;
    vector<int> u(m), v(m), c(m);
    for(int i = 0; i < m; i++){
        cin >> u[i] >> v[i] >> c[i];
        u[i]--, v[i]--;
    }
    auto judge = [&](int x){
        vector<vector<edge>> g(n);
        for(int i = 0; i < m; i++){
            if(c[i] <= x) {
                g[u[i]].push_back(edge{v[i], 0});
                g[v[i]].push_back(edge{u[i], 0});
            }
            else {
                g[u[i]].push_back(edge{v[i], 1});
                g[v[i]].push_back(edge{u[i], 1});
            }
        }
        auto d = dijkstra(0, g);
        // cout << x << ' ' << d[n-1] << endl;
        return d[n-1] <= k-1;
    };
    if(judge(0)) {
        cout << 0 << endl;
        return 0;
    }
    int l = 0, r = 200001;
    while(r-l > 1){
        int x = (l+r)/2;
        if(judge(x)) r = x;
        else l = x;
    }
    cout << r << endl;
}