#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) <= (e);(i)++)

i64 N,M,K,S,T;

vector<i64> A,B,C;

map<i64,i64> dp[202020];
int main(){
  cin >> N >> M >> K >> S >> T;
  A.resize(M);
  B.resize(M);
  C.resize(M);
  vector<vector<pair<i64,i64>>> vec(N);
  vector<vector<pair<i64,i64>>> vec2(N);
  rep(i,0,M - 1){
    cin >> C[i] >> A[i] >> B[i];
    C[i]--;
    vec[C[i]].push_back({B[i],A[i]});
    vec2[C[i]].push_back({A[i],B[i]});
  }
  vec2[N - 1].push_back({T,-1});
  rep(i,0,N - 2){
    sort(vec[i].begin(),vec[i].end());
    sort(vec2[i].begin(),vec2[i].end());
  }

  for(auto p : vec2[0]){
    dp[0][p.first] = abs(S - p.first);
  }

  rep(c,1,N - 1){
    auto & before = vec[c - 1];
    auto & next = vec2[c];
    vector<i64> up_min;
    vector<i64> bot_min;
    for(auto p : before){
      i64 a = p.second;
      i64 b = p.first;
      if(up_min.empty()){
        up_min.push_back(dp[c - 1][a] - b);
      }
      else{
        up_min.push_back(min(up_min.back(),dp[c - 1][a] - b));
      }
    }
    reverse(before.begin(),before.end());

    for(auto p : before){
      i64 a = p.second;
      i64 b = p.first;
      if(bot_min.empty()){
        bot_min.push_back(dp[c - 1][a] + b);
      }
      else{
        bot_min.push_back(min(bot_min.back(),dp[c - 1][a] + b));
      }
    }

    reverse(before.begin(),before.end());

    i64 cnt = 0;

    if(before.empty()){
      cout << -1 << endl;
      return 0;
    }

    for(auto p : next){
      i64 s = p.first;
      while(cnt < before.size() && s > before[cnt].first){
        cnt++;
      }
      i64 MIN;
      if(cnt == 0){
        MIN = bot_min[bot_min.size() - cnt - 1] - s;
      }
      else if(cnt == bot_min.size()){
        MIN = up_min[cnt - 1] + s;
      }
      else{
        MIN = min(bot_min[bot_min.size() - cnt - 1] - s, up_min[cnt - 1] + s);
      }
      dp[c][s] = MIN;
    }
  }

  cout << dp[N - 1][T] << endl;
}