#include <bits/stdc++.h>
#include <malloc.h>

using namespace std;

#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

ll solve(ll w, ll b) {
    ll k;

    if (b % (w - 1) == 0)  k = (b - (w - 1)) / (w - 1);
    else k = b / (w - 1);
    
    return b + k;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m, t;
    cin >> n >> m >> t;
    vector<vector<pair<int, int>>> g(n, vector<pair<int, int>>());
    
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        u--; v--;
        g[u].pb({v, w});
        g[v].pb({u, w});
    }
    
    vector<int> d (n, INT_MAX);
    d[n - 1] = t;
    set <pair<int, int>> q;
    q.insert ({d[n - 1], n - 1});
    while (!q.empty()) {
        int v = q.begin()->second;
        int w = q.begin()->first;
        q.erase (q.begin());
        
        for (int j = 0; j < g[v].size(); j++) {
            int u = g[v][j].first;
            int c = g[v][j].second;
            ll new_w = solve(c, w);
            
            if (new_w < d[u]) {
                q.erase ({d[u], u});
                d[u] = new_w;
                q.insert ({d[u], u});
            }
        }
    }
    
    cout << d[0] << '\n';
    
    return 0;
}