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

using namespace std;

using ll = long long;

ll N, M, K;
vector<ll> u, v, c;

vector<int> zobfs(vector<vector<pair<int, int>>> &E, int start){

    int N = E.size();
    int from, to, alt;
    deque<int> que;
    vector<int> dist(N, 1e9);

    dist[start] = 0;
    que.push_back(start);

    while(!que.empty()){
        from = que.front();
        que.pop_front();
        for (auto [to, C] : E[from]){
            alt = dist[from]+C;
            if (alt < dist[to]){
                dist[to] = alt;
                if (C) que.push_back(to);
                else que.push_front(to);
            }
        }
    }

    return dist;
}

bool solve(ll X){
 
    int A, B, C;
    vector<vector<pair<int, int>>> E(N);
    
    for (int i=0; i < M; i++){
        A = u[i]; B = v[i];
        C = (c[i] > X ? 1 : 0);
        E[A].push_back({B, C});
        E[B].push_back({A, C});
    }
 
    vector<int> dist = zobfs(E, 0);
    return dist[N-1] < K;
}

int main(){
    cin >> N >> M >> K;
    u.resize(M); v.resize(M); c.resize(M);
    for (int i=0; i<M; i++){
        cin >> u[i] >> v[i] >> c[i];
        u[i]--; v[i]--;
    }

    ll l=-1, r=2e5, c;
    while(r-l>1){
        c = (l+r)/2;
        if (solve(c)) r=c;
        else l=c;
    }

    cout << r << endl;
}