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>, s: Int): Array { data class State(val d: Long, val u: Int) : Comparable { override operator fun compareTo(other: State): Int { if (d != other.d) return d.compareTo(other.d) return u.compareTo(other.u) } } var q: PriorityQueue = 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) { var buf: ByteArray = ByteArray(10000000, {0}) System.`in`.read(buf) var bufk = 0 val readLong = fun(): Long { var ans: Long = 0 while ('0'.toInt() > buf[bufk]) bufk++; while ('0'.toInt() <= buf[bufk]) { ans = ans * 10 + (buf[bufk] - '0'.toLong()) bufk++; } return ans } val readInt = fun(): Int = readLong().toInt() val start = System.currentTimeMillis() val N = readInt() val M = readInt() val P = readInt() - 1 val Q = readInt() - 1 val T = readLong() var g = Array(N, {mutableListOf()}) repeat(M) { val u = readInt() - 1 val v = readInt() - 1 val w = readLong() 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) } }