#include <cstdio>
#include <queue>
#include <cstring>
int first[20005],next[20005],v[20005],w[20005],dis[1005];
bool vis[1005];
int n,p,k,t,mx;
using namespace std;
inline void add(int x,int y,int z)
{
	next[++t]=first[x];
	first[x]=t;
	v[t]=y;
	w[t]=z;
}
bool spfa(int x)
{
	memset(vis,0,sizeof(vis));
	memset(dis,0x3f3f3f3f,sizeof(dis));
	queue<int> q;
	vis[1]=1;
	q.push(1);
	dis[1]=0;
	while (!q.empty())
	{
		int y=q.front();
		q.pop();
		vis[y]=0;
		for (int i=first[y];i;i=next[i])
		{
			int j=v[i],now=dis[y];
			if (w[i]>x) now++;
			if (now<dis[j])
			{
				dis[j]=now;
				if (!vis[j])
				{
					vis[j]=1;
					q.push(j);
				}
			}
		}
	}
	return dis[n]<=k;
}
int ef()
{
	int s=-1,l=0,r=mx;
	while (l<=r)
	{
		int mid=l+r>>1;
		if (spfa(mid)) s=mid,r=mid-1; else l=mid+1;
	}
	return s;
}
int Main()
{
	freopen("phoneline.in","r",stdin);
	freopen("phoneline.out","w",stdout);
    scanf("%d%d%d",&n,&p,&k);
	for (int i=1;i<=p;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		add(x,y,z);
		add(y,x,z);
		if (z>mx) mx=z;
	}
    printf("%d\n",ef());
    return 0;
}
int haha=Main();
int main(){;}