#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using i64=int_fast64_t;
using pii=pair<int,int>;
using pll=pair<i64,i64>;
template <class T> constexpr T inf=numeric_limits<T>::max() / (T)2;
template <class T> using minheap=priority_queue<T,vector<T>,greater<T>>;
#define fir first
#define sec second
#define mkp make_pair
#define mkt make_tuple
#define emb emplace_back
#define emp emplace
#define all(v) begin(v),end(v)
void ios_untie() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}
void file_setup() {
    if(!freopen("stderr.txt","wt",stderr)) {
        std::cerr << "Failed to open the stderr file\n";
        freopen("CON","wt",stderr);
    }
    if(!freopen("stdout.txt","wt",stdout)) {
        std::cerr << "Failed to open the stdout file\n";
        freopen("CON","wt",stdout);
    }
    if(!freopen("stdin.txt","rt",stdin)) {
        std::cerr << "Failed to open the stdin file.\n";
        freopen("CON","rt",stdin);
    }
}
i64 binry(i64 ok, i64 ng, const function<bool(i64)> &f) {
    while(abs(ok-ng)>1) {
        i64 mid=(ok+ng)/2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}

int n,P,Q,T;
vector<pii> g[2010];
i64 dist[3][2010];

void solve() {
    size_t indx=0;
    for(int s:{0,P,Q}) {
        auto dis=dist[indx];
        fill(dis,dis+n,inf<i64>);
        minheap<pll> que;
        que.emplace(dis[s]=0,s);
        while(!que.empty()) {
            i64 d; int v; tie(d,v)=que.top(); que.pop();
            if(d!=dis[v]) continue;
            for(auto &e:g[v]) {
                if(d+e.sec<dis[e.fir]) {
                    que.emplace(dis[e.fir]=d+e.sec,e.fir);
                }
            }
        }
        indx++;
    }
    i64 ans=-1;
    for(int i=0; i<n; ++i) {
        for(int j=0; j<=i; ++j) {
            i64 solo=max(dist[1][i]+dist[1][j],dist[2][i]+dist[2][j]);
            i64 tt=dist[0][i]+dist[0][j]+solo;
            if(tt<=T) {
                ans=max(ans,T-solo);
            }
        }
    }
    if(dist[0][P]+dist[0][Q]+dist[1][Q]<=T) ans=T;
    cout<<ans<<endl;
}

signed main() {
    ios_untie();
#ifdef LOCAL
    file_setup();
#endif

    int m;
    cin>>n>>m>>P>>Q>>T;
    P--,Q--;
    while(m--) {
        int u,v,c; cin>>u>>v>>c;
        u--,v--;
        g[u].emplace_back(v,c);
        g[v].emplace_back(u,c);
    }
    solve();
}