#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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(b<a){a=b;return true;}return false;}

template<typename T>
vector<T> dijkstra(int s,vector<vector<pair<int,T>>> &G){
    const T TINF=numeric_limits<T>::max();
    using P=pair<T,int>;
    int n=G.size();
    vector<T> d(n,TINF);
    vector<int> b(n,-1);//previous point
    priority_queue<P,vector<P>,greater<P>> q;
    d[s]=0;
    q.emplace(d[s],s);
    while(!q.empty()){
        P p=q.top();q.pop();
        int v=p.second;
        if(d[v]<p.first) continue;
        for(auto& e:G[v]){
            int u=e.first;
            T c=e.second;
            if(d[u]>d[v]+c){
                d[u]=d[v]+c;
                b[u]=v;
                q.emplace(d[u],u);
            }
        }
    }
    return d;
}



int n,m,p,q;ll t;
vector<vector<pair<int,ll>>> g;


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    cin>>n>>m>>p>>q>>t;p--,q--;
    g.resize(n);
    rep(i,m){
        int a,b;ll c;cin>>a>>b>>c;a--,b--;
        g[a].push_back(make_pair(b,c));
        g[b].push_back(make_pair(a,c));
    }
    auto st0=dijkstra(0,g);
    auto stp=dijkstra(p,g);
    auto stq=dijkstra(q,g);

    ll ans=-1;
    //分担
    rep(i,n){
        rep(j,n){
            ll res=0,cost=0;
            res+=st0[i]+st0[j];
            cost+=st0[i]+max(stp[i]+stp[j],stq[i]+stq[j])+st0[j];
            if(cost>t) continue;
            res+=t-cost;
            chmax(ans,res);
        }
    }

    //分担しない
    {
        ll cost=0;
        if(st0[p]+stp[q]+stq[0]<=t) chmax(ans,t);
    }

    cout<<ans<<endl;
    return 0;
}