#include <iostream>
#include <vector>
#include <climits>
using namespace std;

//vector<vector<pair<int,int>>> put;
int accu=0;
int put[100][100];

void ut(vector<vector<pair<int,int>>> utak, int act, int b, int cost, int& val, vector<bool> visited){
	if(visited[act]==false){
		visited[act]=true;
		if(act==b&&cost<val) val=cost;
		else{
			for(auto uti : utak[act]) ut(utak, uti.first, b, cost+uti.second, val, visited);
		} 
	}
}

void keres(int n, int act, int b, int k, int len, int mx, int& x, vector<bool> visited){
	if(len <= k){
		if(act==b){
			x=min(mx,x);
			//cout << x << ' ' << b << '\n';
		}
		else{
			for(int i=0; i<n; i++) if(visited[i]==false) keres(n, i, b, k, len+1, max(mx,put[act][i]), x, visited);
		}
	}
}

int main(){
	int n, m, k; cin >> n >> m >> k;
	vector<vector<pair<int,int>>> utak; utak.assign(n,vector<pair<int,int>>());
	for(int i=0; i<m; i++){
		int a, b, c; cin >> a >> b >> c; a--; b--;
		utak[a].push_back(make_pair(b,c));
		utak[b].push_back(make_pair(a,c));
	}
	//put.assign(n,vector<pair<int,int>>());
	
	vector<bool> visited; visited.assign(n,false);
	//int put[n][n];
	for(int i=0; i<n; i++) for(int j=0; j<n; j++) put[i][j]=INT_MAX;
	
	for(int i=0; i<n; i++) for(int j=i; j<n; j++){
		ut(utak, i, j, 0, put[i][j], visited);
		put[j][i]=put[i][j];
		//cout << put[i][j] << ' ' << i << ' ' << j << '\n';
	}
	
	for(int i=0; i<n; i++) for(int j=i; j<n; j++){
		int x=INT_MAX;
		keres(n,i,j,k,0,0,x,visited);
		accu = max(accu,x);
	}
	
	cout << accu;
}