import java.util.PriorityQueue
import java.util.Scanner
import java.io.BufferedReader
import java.io.InputStreamReader

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
}

class Reader {
  var buf: ByteArray = ByteArray(5000000, {0})
  var k: Int = 0
  var n: Int = 0

  private fun check() {
    if (k == n) {
      n = System.`in`.read(buf)
      k = 0
    }
  }

  private fun peek(): Byte {
    check()
    return buf[k]
  }

  fun next() {
    k++
    check()
  }

  fun long(): Long {
    var ans: Long = 0
    while ('0'.toInt() > peek()) next();
    while ('0'.toInt() <= peek()) {
      ans = ans * 10 + (peek() - '0'.toLong())
      next() 
    }
    return ans
  }

  fun int(): Int {
    return long().toInt()
  }
}

fun main(args: Array<String>) {
  var r = Reader()
  val start = System.currentTimeMillis()
  val N = r.int()
  val M = r.int()
  val P = r.int() - 1
  val Q = r.int() - 1
  val T = r.long()
  var g = Array(N, {mutableListOf<Edge>()})
  repeat(M) {
    val u = r.int() - 1
    val v = r.int() - 1
    val w = r.long()
    g[u].add(Edge(v, w))
    g[v].add(Edge(u, w))
  }
  val end = System.currentTimeMillis()
  System.err.println(end - start)
  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)
  }
}