#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); }
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(dumpall_i, (q).size()) { cerr << q[dumpall_i] << (dumpall_i == (q).size() - 1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; }
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
using  ll = long long;
using ull = unsigned long long;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ll n, m, p, q, t;
    cin >> n >> m >> p >> q >> t;
    p--; q--;

    vector<vector<pair<ll, ll>>> g(n); // (dest, cost)
    REP(i, m) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        g[a].emplace_back(b, c);
        g[b].emplace_back(a, c);
    }

    using pllll = pair<ll, ll>;

    auto dijcmp = [](pllll i, pllll j) -> bool {
        return i.second > j.second;
    };

    // daikusutora O(N(M + NlogN))
    // may the time be in
    vector<vector<ll>> d(n, vector<ll>(n, INF));
    REP(_i, 3) {

        ll i;
        switch(_i) {
            case 0: i = 0; break;
            case 1: i = p; break;
            case 2: i = q; break;
        }
        
        priority_queue<pllll, vector<pllll>, decltype(dijcmp)> q(dijcmp); // (dest, cost)

        q.push(pllll(i, 0));

        while (!q.empty()) {

            pllll v = q.top(); q.pop();
            if (!chmin(d[i][v.first], v.second)) continue;
            d[v.first][i] = v.second;

            for (pllll &vn : g[v.first]) {
                ll cn = v.second + vn.second;
                if (d[i][vn.first] > cn) {
                    q.push(pllll(vn.first, cn));
                }
            }

        }

    }

    // cerr << "[DEBUG] [\n";
    // REP(i, n) REP(j, n) cerr << d[i][j] << " \n"[j==n-1];

    // always together (hokkori)
    if (d[0][p] + d[p][q] + d[q][0] <= t) {
        cout << t << endl;
        return 0;
    }

    ll ans = -1;

    // they have to trip apart
    // 0 -> i -> p -> j -> 0
    //      +--> q ---^
    REP(i, n) REP(j, n) { // i: 経由点
        ll tt = d[0][i] + d[j][0];
        ll tn = tt + max(d[i][p] + d[p][j], d[i][q] + d[q][j]);
        if (tn <= t) {
            chmax(ans, tt + (t - tn));
        }
    }

    cout << ans << endl;
    
}