#include<bits/stdc++.h>
using namespace std;

struct edge{
  int to;
  int c;
};

int main(){
  int n, m, k;
  cin >> n >> m >> k;
  
  vector<vector<edge>>g(n);
  for(int i = 0; i < m; i++){
    int u, v, c;
    cin >> u >> v >> c;
    u--, v--;
    g[u].push_back({v, c});
    g[v].push_back({u, c});
  }

  using pi = pair<int, int>;
  int ok = 300000, ng = -1;
  while(ok - ng >= 2){
    int mid = (ok + ng) / 2;
    priority_queue<pi, vector<pi>, greater<pi>>que;
    vector<int>dist(n, 1e9);
    dist[0] = 0;
    que.emplace(0, 0);
    while(!que.empty()){
      auto [d, v] = que.top();
      que.pop();
      if(dist[v] != d)continue;
      for(auto e:g[v]){
        int nd = d + (e.c > mid);
        if(dist[e.to] > nd){
          dist[e.to] = nd;
          que.emplace(nd, e.to);
        }
      }
    }

    if(dist[n - 1] < k)ok = mid;
    else ng = mid;
  }

  cout << ok << endl;
}