import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;
long K, S, T;
int[] A;
long[] B, C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      K = readLong();
      S = readLong();
      T = readLong();
      A = new int[M];
      B = new long[M];
      C = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readLong();
        C[i] = readLong();
      }
      
      auto ys = new long[][N];
      foreach (a; 0 .. N) {
        ys[a] ~= 1;
        ys[a] ~= K;
      }
      ys[0] ~= S;
      ys[N - 1] ~= T;
      foreach (i; 0 .. M) {
        ys[A[i]] ~= B[i];
        ys[A[i] + 1] ~= C[i];
      }
      auto len = new int[N];
      int V;
      auto ids = new int[][N];
      foreach (a; 0 .. N) {
        ys[a] = ys[a].sort.uniq.array;
        len[a] = cast(int)(ys[a].length);
        ids[a] = iota(V, V + len[a]).array;
        V += len[a];
      }
      debug {
        writeln("len = ", len);
        writeln("ys = ", ys);
        writeln("V = ", V);
        writeln("ids = ", ids);
      }
      
      alias Edge = Tuple!(long, int);
      auto graph = new Edge[][V];
      foreach (a; 0 .. N) {
        foreach (j; 0 .. len[a] - 1) {
          const u = ids[a][j];
          const v = ids[a][j + 1];
          const c = ys[a][j + 1] - ys[a][j];
          graph[u] ~= Edge(c, v);
          graph[v] ~= Edge(c, u);
        }
      }
      int getId(int a, long y) {
        return ids[a][ys[a].lowerBound(y)];
      }
      const src = getId(0, S);
      const dst = getId(N - 1, T);
      foreach (i; 0 .. M) {
        const u = getId(A[i], B[i]);
        const v = getId(A[i] + 1, C[i]);
        graph[u] ~= Edge(0, v);
        graph[v] ~= Edge(0, u);
      }
      
      BinaryHeap!(Array!Edge, "a > b") q;
      auto dist = new long[V];
      dist[] = -1;
      dist[src] = 0;
      q.insert(Edge(0, src));
      long ans = -1;
      for (; !q.empty; ) {
        const c = q.front[0];
        const u = q.front[1];
        q.removeFront;
        if (dist[u] == c) {
          foreach (e; graph[u]) {
            const cc = c + e[0];
            const v = e[1];
            if (dist[v] == -1 || dist[v] > cc) {
              dist[v] = cc;
              q.insert(Edge(cc, v));
            }
          }
        }
      }
      writeln(dist[dst]);
    }
  } catch (EOFException e) {
  }
}