import sequtils,strutils,math
type
    priorityQue[I:static[int];T:tuple] = array[I + 1,T]
    item = tuple[cost: int,ID : int]
var hyou : array[2001, array[2001, int]]
proc push[T](A:var priorityQue; b: T;)=
    const key = 0
    A[0][0] += 1
    A[A[0][0]] = b # A[0][0]はsize、最大のIndex
    var index = A[0][0]
    while index > 1 and A[index][key] > A[index div 2][key]:
        (A[index],A[index div 2]) = (A[index div 2],A[index])
        index = index div 2
proc pop(A: var priorityQue):item =
    const key = 0
    result = A[1]
    A[1] = A[A[0][0]]
    var a : item
    A[A[0][0]] = a
    A[0][0] -= 1
    var index = 1
    while index * 2 <= A[0][0]:
        if index * 2 + 1<= A[0][0]:
            if A[index][key] < A[index * 2][key] and A[index * 2 + 1][key] <= A[index * 2][key]:
                (A[index],A[index * 2]) = (A[index * 2],A[index])
                index = index * 2
            elif A[index][key] < A[index * 2 + 1][key]:
                (A[index],A[index * 2 + 1]) = (A[index * 2 + 1],A[index])
                index = index * 2 + 1
            else:
                break
        elif index * 2 <= A[0][0]:
            if A[index][key] < A[index * 2][key]:
                (A[index],A[index * 2]) = (A[index * 2],A[index])
            break
        else:
            break
proc size(A : priorityQue):int=
    return A[0][0]
    
    
var pq : priorityQue[201000, item]
proc dijikstra(i : int) : seq[int]=
    var res = newSeq[int](2001) #N_maxに書き換える
    for i in 0..2000:
        res[i] = int.high
    pq.push((0, i))
    while pq.size > 0 :
        var a = pq.pop
        if res[a.ID] != int.high:
            continue
        res[a.ID] = - a.cost
        for np, c in hyou[a.ID]: #表がN * N の時
            if c < int.high and res[np] == int.high:
                pq.push((a.cost - c, np))
        #[for edge in hyou[a.ID]: #表が隣接表示 hyou = array[tuple[to, cost : int]]
            if res[edge.to] == int.high:
                pq.push((a.cost - edge.cost, edge.to))]#
    return res
var
    N,M,P,Q,T : int
    a,b,c : int
(N, M, P, Q, T) = stdin.readline.split.map(parseInt)
for i in 0..2000:
    for j in 0..2000:
        hyou[i][j] = int.high
    
for i in 1..M:
    (a, b, c) = stdin.readline.split.map(parseInt)
    hyou[a][b] = c
    hyou[b][a] = c
var
    cos1 = dijikstra(1)
    cosQ = dijikstra(Q)
    cosP = dijikstra(P)
    ans = -1
for i in 1..N:
    for j in 1..N:
        if cos1[i] + max(cosQ[i] + cosQ[j], cosP[i] + cosP[j]) + cos1[j] <= T:
            ans = max(ans, T - max(cosQ[i] + cosQ[j], cosP[i] + cosP[j]))
if cos1[P] + cos1[Q] + cosP[Q] <= T:
    ans = T
echo ans