#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll mx=100000000001;
vector<pair<ll,ll>> g[101];
bool dijkstra(ll mxut, ll k, ll x, ll n){
    priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> q;
    vector<ll> maxk;
    maxk.resize(n+1,0);
    q.push({0,x});
    vector<ll>t;
    t.resize(101, mx);
    t[x]=0;
    while (!q.empty()){
        auto v=q.top();
        q.pop();

        for (auto edge:g[v.second]){
                bool van=false;
                if (t[edge.first]>edge.second+v.first){
                    if (edge.second+v.first>mxut){
                        if (edge.second<=mxut){;
                            t[edge.first]=edge.second;
                            maxk[edge.first]=max(maxk[edge.first], maxk[v.second]+1);
                            van=true;
                        }
                    }
                    else{
                            t[edge.first]=edge.second+v.first;
                            van=true;
                            }
                    if (van) q.push({t[edge.first],edge.first});
                }
        }
    }
    for (ll i=1; i<=n;i++) if (maxk[i]>k || t[i]==mx)  return false;
    return true;
}
int main()
{
    ll n,m,k;
    cin>>n>>m>>k;
    ll r=0;
    for (ll i=0; i<m;i++){
        ll a, b,c;
        cin>>a>>b>>c;
        r+=c;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    ll l=0;
    while (l!=r){
         ll m=(l+r)/2;
         bool good=true;
         for (ll i=1; i<=n;i++){
                if (!dijkstra(m,k,i,n)) good=false;
         }
         if (good) r=m;
         else l=m+1;
    }
    cout<<l<<endl;
}