#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;

//ダイクストラ (ABC035-D)
typedef pair<ll,int> P;
vector<ll> dijkstra(int s, const vector<vector<pair<int,int> > >& G){
    priority_queue< P, vector<P>, greater<P> > que;
    vector<ll> d(G.size(), LINF);
    d[s] = 0;
    que.push(P(0, s));
    while(!que.empty()){
        int curr  = que.top().second;
        ll  dcurr = que.top().first;
        que.pop();
        if(d[curr] < dcurr) continue;
        int i;
        for(i=0; i<(int)G[curr].size(); i++){ 
            int next = G[curr][i].first;
            ll  dist = G[curr][i].second;
            if(d[next] > d[curr] + dist){
                d[next] = d[curr] + dist;
                que.push(P(d[next], next));
            }
        }
    }
    return d;
}

int main(int argc, char* argv[])
{
    int n,m,p,q,t;
    scanf("%d%d%d%d%d", &n, &m, &p, &q, &t);
    p--; q--;

    vector<vector<pair<int, int> > > g(n);
    int i,j;
    for(i=0; i<m; i++) {
        int a,b,c;
        scanf("%d%d%d", &a, &b, &c);
        g[a-1].push_back(make_pair(b-1,c));
        g[b-1].push_back(make_pair(a-1,c));
    }

    vector<ll> v0=dijkstra(0, g);
    vector<ll> v1=dijkstra(p, g);
    vector<ll> v2=dijkstra(q, g);

    ll ans=-1;
    if(v0[p]+v0[q]+v1[q]<=t) {
        ans = t;
    }

    for(i=0; i<n; i++) {
        for(j=0; j<n; j++) {
            ll dist=v0[i]+v0[j]+MAX(v1[i]+v1[j],v2[i]+v2[j]);
            if(dist<=t) {
                ll val=v0[i]+v0[j]+(t-dist);
                ans=MAX(ans,val);
            }
        }
    }
    printf("%lld\n", ans);

    return 0;
}