#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, m, k, s, t;
map<int, ll> dp[200005];
vector<pii> v[200005];

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> k >> s >> t;
  FOR(i, 0, m){
    int a, b, c;
    cin >> a >> b >> c;
    dp[a][b] = linf;
    dp[a+1][c] = linf;
    v[a].pb(mp(b, c));
  }
  dp[1][s] = 0;
  dp[n][t] = linf;
  int p, tp;
  ll pp, tpp;
  FOR(i, 0, n){
    each(itr, v[i])mins(dp[i+1][itr->se], dp[i][itr->fi]);
    int p;
    ll pp;
    p = -1;
    pp = linf;
    for(map<int, ll>::iterator itr=dp[i+1].begin(); itr!=dp[i+1].end(); itr++){
      tp = itr->fi;
      tpp = itr->se;
      mins(dp[i+1][tp], pp + tp - p);
      p = itr->fi;
      pp = dp[i+1][tp];
    }
    p = k+5;
    pp = linf;
    for(map<int, ll>::reverse_iterator itr=dp[i+1].rbegin(); itr!=dp[i+1].rend(); itr++){
      tp = itr->fi;
      tpp = itr->se;
      mins(dp[i+1][tp], pp + p - tp);
      p = itr->fi;
      pp = dp[i+1][tp];
    }
  }
  cout << (dp[n][t] >= linf ? -1 : dp[n][t]) << endl;
  return 0;
}