#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
using namespace std;

int n, k, d[200009], inf = 1000000000;
vector<pair<int, int> > v[200009];
list<pair<int, int> > dq;

bool ps(int l)
{
	for (int i = 1; i <= n; i++)
		d[i] = inf;
	dq.clear();
	dq.push_back(make_pair(1, 0)); 
	d[1] = 0;
	while (!dq.empty()) {
		int hn = dq.front().first, hl = dq.front().second; dq.pop_front();
		if (d[hn] != hl) continue;
		for (int i = 0; i < v[hn].size(); i++) {
			int tn = v[hn][i].first, w = (v[hn][i].second > l) ? 1 : 0;
			if (d[tn] > d[hn] + w) {
				d[tn] = d[hn] + w;
				if (w) dq.push_back(make_pair(tn, d[tn]));
				else dq.push_front(make_pair(tn, d[tn]));
			}
		}
	}
	return (d[n] < k);
}

int bs(int s, int e)
{
	int md = (s + e) / 2;
	while (s < e) {
		if (ps(md)) e = md;
		else s = md + 1;
		md = (s + e) / 2;
	}
	return md;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int m; cin >> n >> m >> k;
	for (int i = 0; i < m; i++) {
		int a, b, w; cin >> a >> b >> w;
		v[a].push_back(make_pair(b, w));
		v[b].push_back(make_pair(a, w));
	}
	cout << bs(0, 200000) << '\n';
	return 0;
}