import java.util.PriorityQueue
import java.util.Scanner

data class Edge(val v: Int, val w: Long)

val INF = 1e18.toLong()

fun dijkstra(g: Array<MutableList<Edge>>, s: Int): Array<Long> {
  data class State(val d: Long, val u: Int) : Comparable<State> {
    override operator fun compareTo(other: State): Int {
      if (d != other.d) return -d.compareTo(other.d)
      return u.compareTo(other.u)
    }
  }
  var q: PriorityQueue<State> = PriorityQueue()
  val n = g.size
  var dist = Array(n, {INF})
  dist[s] = 0
  q.add(State(0, s))
  while (!q.isEmpty()) {
    val (d, u) = q.remove()
    if (d > dist[u]) continue
    for (e in g[u]) {
      if (dist[e.v] > dist[u] + e.w) {
        dist[e.v] = dist[u] + e.w
        q.add(State(dist[e.v], e.v))
      }
    }
  }
  return dist
}

fun main(args: Array<String>) {
  val sc = Scanner(System.`in`)
  val N = sc.nextInt()
  val M = sc.nextInt()
  val P = sc.nextInt() - 1
  val Q = sc.nextInt() - 1
  val T = sc.nextLong()
  var g = Array(N, {mutableListOf<Edge>()})
  repeat(M) {
    val u = sc.nextInt() - 1
    val v = sc.nextInt() - 1
    val w = sc.nextLong()
    g[u].add(Edge(v, w))
    g[v].add(Edge(u, w))
  }
  val d0 = dijkstra(g, 0)
  val dp = dijkstra(g, P)
  val dq = dijkstra(g, Q)
  var ans = -INF
  if (dp[0] + dp[Q] + dq[0] <= T) {
    ans = T
  }
  for (i in 0..N-1) {
    for (j in 0..N-1) {
      if (d0[i] + d0[j] + maxOf(dp[i] + dp[j], dq[i] + dq[j]) <= T) {
        ans = maxOf(ans, T - maxOf(dp[i] + dp[j], dq[i] + dq[j]))
      }
    }
  }
  if (ans < 0L) {
    println(-1)
  } else {
    println(ans)
  }
}