from heapq import heappush, heappop
from collections import defaultdict

def dijkstra(start):
    distance = [10 ** 18 for _ in range(N)]
    distance[start] = 0
    priority_queue = []
    
    for i in range(N):
        heappush(priority_queue, (distance[i], i))
    
    while len(priority_queue) > 0:
        current_dist, current_node = heappop(priority_queue)
        if distance[current_node] < current_dist:
            continue
        for next_node, w in adj_dict[current_node]:
            if distance[next_node] > distance[current_node] + w:
                distance[next_node] = distance[current_node] + w
                heappush(priority_queue, (distance[next_node], next_node))
    
    return distance

N, M, P, Q, T = map(int, input().split())
adj_dict = defaultdict(list)

for _ in range(M):
    a_i, b_i, c_i = map(int, input().split())
    adj_dict[a_i-1].append((b_i-1, c_i))
    adj_dict[b_i-1].append((a_i-1, c_i))

distance_from0 = dijkstra(0)
distance_fromP = dijkstra(P-1)
distance_fromQ = dijkstra(Q-1)
ans = -10 ** 18

if distance_from0[P-1] + distance_fromP[Q-1] + distance_fromQ[0] <= T:
    print(T)
    exit()

for m1 in range(N):
    for m2 in range(m1, N):
        if distance_from0[m1] + max(distance_fromP[m1]+distance_fromP[m2], distance_fromQ[m1]+distance_fromQ[m2]) + distance_from0[m2] <= T:
            ans = max(ans, distance_from0[m1] + distance_from0[m2] + T - (distance_from0[m1] + max(distance_fromP[m1]+distance_fromP[m2], distance_fromQ[m1]+distance_fromQ[m2]) + distance_from0[m2]))

if ans == -10 ** 18:
    print(-1)
else:
    print(ans)