// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

bool exist[200010];
vector<pii> edges[200010];
map< int, map<int, int> > rec;

struct Elem {
    int idx, flr, cost;
    bool operator<(const Elem &x) const {
        return cost > x.cost;
    }
};

signed main() {
    int N, M, K, S, T; cin >> N >> M >> K >> S >> T;
    rep(i,0,M) {
        int a, b, c; cin >> a >> b >> c;
        exist[a] = true;
        edges[a].push_back(make_pair(b, c));
        if(a == N-1) edges[N].push_back(make_pair(c, T));
    }

    int cnt = 0;
    rep(i,1,N) cnt += exist[i];
    if(cnt != N-1) {
        cout << -1 << endl;
        return 0;
    }

    priority_queue<Elem> que;
    que.push(Elem{1, S, 0});
    rec[1][S] = 0;
    while(!que.empty()) {
        Elem cur = que.top(); que.pop();
        int idx = cur.idx, flr = cur.flr, cost = cur.cost;
        if(idx == N && flr == T) {
            cout << cost << endl;
            return 0;
        }

        for(auto e : edges[idx]) {
            int cur_flr = e.first, nxt_flr = e.second;
            int dist, nxt_idx;

            if(idx == N) {
                if(cur_flr != flr) continue;
                dist = abs(cur_flr - nxt_flr);
                nxt_idx = N;
            }
            else {
                dist = abs(flr - cur_flr);
                nxt_idx = idx + 1;
            }

            // printf("cur_flr = %lld, nxt_flr = %lld, dist = %lld\n", cur_flr, nxt_flr, dist);

            if(!rec[nxt_idx].count(nxt_flr) || rec[nxt_idx][nxt_flr] > cost + dist) {
                int ncost = rec[nxt_idx][nxt_flr] = cost + dist;
                que.push(Elem{nxt_idx, nxt_flr, ncost});
            }
        }
    }
    return 0;
}