#include<iostream>
#include<cstring>
#include<deque>
#include<algorithm>
#pragma GCC optimize(2)
#define ll long long 
using namespace std;
const int MAXN=1005,MAXM=10005;

struct Edge{
	int v,w,nxt;
}edge[MAXM*2];

struct node{
	int a,b,w;
	bool operator < (const node &x) const 
	{
		return w<x.w;
	}
}E[MAXM];
int head[MAXN],dis[MAXN];
int n,m,cnt,l,r,mid,k;
bool vis[MAXN];

bool flag=true;
void add_edge(int u,int v,int w)
{
	edge[++cnt].v=v;
	edge[cnt].w=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt;
}

bool check(int x)
{
	memset(dis,0x3f,sizeof(dis));
	memset(vis,0,sizeof(vis));
	deque<int> q;
	dis[1]=0;
	q.push_front(1);
	int maxw=E[x].w;
	while(!q.empty())
	{
		int u=q.front();q.pop_front();
		vis[u]=true;
		for(int i=head[u];i;i=edge[i].nxt)
		{
			
			int v=edge[i].v,w=edge[i].w;

			if(!vis[v])
			{
				if(w<=maxw)
				{
					dis[v]=min(dis[v],dis[u]);
					q.push_front(v);
				}
				else 
				{
					
					dis[v]=min(dis[v],dis[u]+1);
					q.push_back(v);				
				}

			}

		}	
	}
	if(dis[n]>300000) 
	{
		cout<<-1<<endl;
		flag=false;
	}
	return dis[n]<=k;

}


int main()
{
    cin>>n>>m>>k;
	for(int i=1;i<=m;++i)
	{
		cin>>E[i].a>>E[i].b>>E[i].w;
		add_edge(E[i].a,E[i].b,E[i].w);
		add_edge(E[i].b,E[i].a,E[i].w);
	}
	
	sort(E+1,E+m+1);
	l=1;r=m;
	while(l<r)
	{		
		mid=(l+r)>>1;
		if(check(mid))
		{
			r=mid;
		}
		else l=mid+1;
		if(!flag) return 0;
	}
	cout<<E[l].w<<endl;
	return 0;
}