using ll = long long;
#include <bits/stdc++.h>
using namespace std;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	int m;
	int l;
	cin >> n >> m >> l;
	ll e = 1000000000000000LL;
	vector<vector<ll>> d(n, vector<ll>(n, e));
	for (int i = 0; i < n; i++) {
		d[i][i] = 0;
	}
	for (int i = 0; i < m; i++) {
		int u;
		int w;
		ll c;
		cin >> u >> w >> c;
		u--;
		w--;
		if (c < d[u][w]) {
			d[u][w] = c;
			d[w][u] = c;
		}
	}
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (d[i][k] + d[k][j] < d[i][j]) {
					d[i][j] = d[i][k] + d[k][j];
				}
			}
		}
	}
	vector<ll> v;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			v.push_back(d[i][j]);
		}
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	auto f = [&](ll c) {
		vector<vector<int>> a(n, vector<int>(n));
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (i == j) {
					a[i][j] = 0;
				} else if (d[i][j] <= c) {
					a[i][j] = 1;
				} else {
					a[i][j] = n + 1;
				}
			}
		}
		for (int k = 0; k < n; k++) {
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < n; j++) {
					if (a[i][k] + a[k][j] < a[i][j]) {
						a[i][j] = a[i][k] + a[k][j];
					}
				}
			}
		}
		for (auto& t : a) {
			for (int y : t) {
				if (y > l) {
					return false;
				}
			}
		}
		return true;
	};
	ll p = 0;
	ll z = v.size();
	ll q = z - 1;
	ll s = v.back();
	while (p <= q) {
		ll r = p + (q - p) / 2;
		if (f(v[r])) {
			s = v[r];
			q = r - 1;
		} else {
			p = r + 1;
		}
	}
	cout << s << '\n';
	return 0;
}