#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
int n,m,k;
int d[1010],vis[1010];
struct Edge{int v,w;};
struct Node
{
    int u,d;
    bool operator<(const Node &a) const
    {
        return d > a.d;
    }
};
vector<Edge> adj[1010];
bool dijkstra(int mid)
{
	priority_queue<Node> q;
    memset(d,0x3f,sizeof(d));
    d[1] = 0;
    long long minn,u = 0;
   	for(int i = 1;i <= n;i++) 
    {
       	minn = 1e18;
       	for(int j = 1;j <= n;j++)
			if(!vis[j] && d[j] < minn)
			{
				minn = d[j];
				u = j;
			}
       	vis[u] = 1;
       	for(auto v:adj[u])
       	{
			if(v.w > mid) d[v.v] = min(d[v.v],d[u] + 1);
			else d[v.v] = min(d[v.v],d[u]);
       	}
   	}
   	if(d[n] > 1e8) return -1;
    return d[n] <= k;
}
int main()
{
	scanf("%d%d%d",&n,&m,&k);
	for (int i = 1;i <= m;i++)
	{
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		adj[u].push_back({v,w});
		adj[v].push_back({u,w});
	}
	int l = 1,r = 1000000,ans = -1;
	while(l <= r)
	{
		int mid = (l + r) / 2;
		if (dijkstra(mid) == -1) break;
		if (dijkstra(mid))
		{
			ans = mid;
			r = mid - 1;
		}
		else l = mid + 1;
	}
	printf("%d\n",ans);
	return 0;
}