#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct edge {
	int v;
	long long w;
	edge() {}
	edge(int v, long long w) : v(v), w(w) {};
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, p, q, t; cin >> n >> m >> p >> q >> t;
	p--, q--;
	vector to(n, vector<edge>());
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c; a--, b--;
		to[a].emplace_back(b, c);
		to[b].emplace_back(a, c);
	}
	vector<vector<long long>>dp(3, vector<long long>(n, LINF));
	vector<int>st = { 0,p,q };
	rep(i, 3) {
		priority_queue<P, vector<P>, greater<P>> q;
		q.push({ 0, st[i] });
		dp[i][st[i]] = 0;
		while (!q.empty()) {
			auto tmp = q.top();
			q.pop();
			long long cost = tmp.first;
			int pos = tmp.second;
			if (cost > dp[i][pos]) continue;
			for (auto e : to[pos]) {
				long long ncost = cost + e.w;
				int npos = e.v;
				if (chmin(dp[i][npos], ncost)) q.push({ ncost, npos });
			}
		}
	}
	long long ans = -1;
	if (t >= dp[0][p] + dp[1][q] + dp[0][q]) {
		// 1->p->q->1
		ans = t;
	}
	rep(i, n)rep(j, n) {
		// 1->i->p->j->1
		// 1->i->q->j->1
		long long x = dp[0][i] + dp[1][i] + dp[1][j] + dp[0][j];
		long long y = dp[0][i] + dp[2][i] + dp[2][j] + dp[0][j];
		if (x > t)continue;
		if (y > t)continue;
		long long val = max(dp[1][i] + dp[1][j], dp[2][i] + dp[2][j]);
		chmax(ans, t - val);
	}
	cout << ans << endl;
	return 0;
}