using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Runtime.Intrinsics.Arm;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, p, q, t) = (c[0], c[1], c[2], c[3], c[4]);
        var map = NArr(m);
        var tree = new List<(int to, long len)>[n + 1];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, long len)>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add((edge[1], edge[2]));
            tree[edge[1]].Add((edge[0], edge[2]));
        }
        var slen = GetLen(n, tree, 1);
        var plen = GetLen(n, tree, p);
        var qlen = GetLen(n, tree, q);
        if (plen[1] + plen[q] + qlen[1] <= t)
        {
            WriteLine(t);
            return;
        }
        if (plen[1] * 2 > t || qlen[1] * 2 > t)
        {
            WriteLine(-1);
            return;
        }
        var ans = 0L;
        for (var x = 1; x <= n; ++x) for (var y = 1; y <= n; ++y)
        {
            var sum = Math.Max(slen[x] + plen[x] + plen[y] + slen[y], slen[x] + qlen[x] + qlen[y] + slen[y]);
            if (t >= sum) ans = Math.Max(ans, t - sum + slen[x] + slen[y]);
        }
        WriteLine(ans);
    }
    static long[] GetLen(int n, List<(int to, long len)>[] tree, int start)
    {
        var INF = long.MaxValue / 2;
        var ans = Enumerable.Repeat(INF, n + 1).ToArray();
        ans[start] = 0;
        var pq = new PriorityQueue<(int pos, long len), long>();
        pq.Enqueue((start, 0), 0);
        while (pq.Count > 0)
        {
            var cur = pq.Dequeue();
            if (ans[cur.pos] != cur.len) continue;
            foreach (var next in tree[cur.pos])
            {
                if (ans[next.to] <= cur.len + next.len) continue;
                ans[next.to] = cur.len + next.len;
                pq.Enqueue((next.to, ans[next.to]), ans[next.to]);
            }
        }
        return ans;
    }
}