#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

void dijkstra(ll start, vector<vector<pair<ll, ll>>>& graph, vector<ll>& dist) {
	dist[start] = 0;
	priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
	vector<bool> used(dist.size(), false);
	pq.push(make_pair(0, start));
	while (!pq.empty()) {
		ll d, node;
		tie(d, node) = pq.top();
		pq.pop();
		if (used[node]) continue;
		used[node] = true;
		for (pair<ll, ll> element : graph[node]) {
			ll new_d, new_node;
			tie(new_node, new_d) = element;
			new_d += d;
			if (new_d < dist[new_node]) {
				dist[new_node] = new_d;
				pq.push(make_pair(dist[new_node], new_node));
			}
		}
	}
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll N, M, P, Q, T; scanf("%lld %lld %lld %lld %lld", &N, &M, &P, &Q, &T);
	P--; Q--;
	vector<vector<pair<ll, ll>>> g(N);
	for (ll i = 0; i < M; i++) {
		ll a, b, c; scanf("%lld %lld %lld", &a, &b, &c);
		a--; b--;
		g[a].emplace_back(b, c);
		g[b].emplace_back(a, c);
	}
	vector<vector<ll>> dist(3, vector<ll>(N, INF));
	dijkstra(0, g, dist[0]);
	dijkstra(P, g, dist[1]);
	dijkstra(Q, g, dist[2]);
	if (max(dist[0][P] , dist[0][Q]) * 2 > T) {
		//cout << dist[0][P] << " " << dist[0][Q] << endl;
		puts("-1");
		return 0;
	}
	if (dist[0][P] + dist[1][Q] + dist[0][Q] <= T) {
		cout << T << endl;
		return 0;
	}
	ll res = 0;
	for (ll i = 0; i < N; i++) {
		for (ll j = 0; j < N; j++) {
			ll len1 = dist[0][i];
			ll len2 = dist[1][i];
			ll len3 = dist[2][i];
			ll len4 = dist[1][j];
			ll len5 = dist[2][j];
			ll len6 = dist[0][j];
			if (len1 + len6 + max(len2 + len4, len3 + len5) <= T) {
				cout << i << " " << j << endl;
				chmax(res, T - max(len2 + len4, len3 + len5));
			}
		}
	}
	cout << res << endl;
	return 0;
}