#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<int, ll>;
vector<vector<ll> > mat;
vector<pl> mini1, mini2;
vector<bool> vis;
int n, s;
bool can(ll x)
{
    int maxi = 0;
    for(int i = 1; i <= n; i++)
    {
        mini1.assign(n + 1, {1e9, 1e18});
        mini2.assign(n + 1, {1e9, 1e18});
        vis.assign(2 * n + 1, 0);
        mini1[i] = {0, x};
        for(int j = 0; j < 2 * n; j++)
        {
            int act = -1;
            pl mv = {1e9 + 1, 1e18 + 1};
            for(int k = 1; k <= n; k++)
            {
                if(mini1[k] < mv && !vis[k])
                {
                    mv = mini1[k];
                    act = k;
                }
                if(mini2[k] < mv && !vis[k + n])
                {
                    mv = mini2[k];
                    act = k + n;
                }
            }
            vis[act] = 1;
            if(act <= n)
            {
                for(int k = 1; k <= n; k++)
                {
                    if(mat[act][k] > x) continue;
                    ll a = mini1[act].first, b = mini1[act].second;
                    pl len = mini1[act];
                    if(x - b < mat[act][k])
                    {
                        len.first++;
                        len.second = mat[act][k];
                    }
                    else len.second += mat[act][k];
                    if(len < mini1[k])
                    {
                        mini1[k] = len;
                    }
                    if(len.first != mini1[k].first) mini2[k] = min(mini2[k], len);
                }
            }
            else
            {
                act -= n;
                for(int k = 1; k <= n; k++)
                {
                    if(mat[act][k] > x) continue;
                    ll a = mini2[act].first, b = mini2[act].second;
                    pl len = mini2[act];
                    if(x - b < mat[act][k])
                    {
                        len.first++;
                        len.second = mat[act][k];
                    }
                    else len.second += mat[act][k];
                    if(len < mini1[k])
                    {
                        mini1[k] = len;
                    }
                    if(len.first != mini1[k].first) mini2[k] = min(mini2[k], len);
                }
            }
        }
        for(int j = 1; j <= n; j++) maxi = max(maxi, mini1[j].first);
    }
    return maxi <= s;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int m;
    cin >> n >> m >> s;
    mat.assign(n + 1, vector<ll>(n + 1, 1e18));
    for(int i = 0; i < m; i++)
    {
        ll x, y, z;
        cin >> x >> y >> z;
        mat[x][y] = z;
        mat[y][x] = z;
    }
    long long l = 0, r = 1e12;
    while(l + 1 != r)
    {
        ll mi = (l + r) / 2;
        if(can(mi)) r = mi;
        else l = mi;
    }
    cout << r;
}