#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
typedef pair<int, int> str;
typedef long long int ll;
const int N = 200000;
vector<str> G[N - 1];
vector<ll> dp[2];
int n, m, k, s, t;

ll mn(ll a, ll b) {
	if (a == -1)return b; if (b == -1)return a;
	return min(a, b);
}

int main() {
	cin >> n >> m >> k >> s >> t;
	for (int i = 0; i < m; i++) {
		int a, b, c; cin >> a >> b >> c;
		G[a - 1].push_back(make_pair(b, c));
	}
	for (int i = 0; i < G[0].size(); i++) { dp[0].push_back(abs(G[0][i].first - s)); }
	for (int i = 0; i < n - 2; i++) {
		dp[(i + 1) % 2].reserve(G[i + 1].size());
		for (int j = 0; j < dp[(i + 1) % 2].size(); j++)dp[(i + 1) % 2][j] = -1;
		for (int j = 0; j < G[i].size(); j++) {
			ll cp = G[i][j].second,cv=dp[i%2][j];
			for (int k = 0; k < G[i + 1].size(); k++) {
				dp[(i + 1) % 2][k] = mn(dp[(i + 1) % 2][k], cv + abs(cp - G[i + 1][k].first));
			}
		}
		dp[i % 2].clear();
	}

	if (n == 1) { cout << abs(t - s) << endl; }
	else {
		ll ans = -1;
		for (int j = 0; j < dp[(n - 2) % 2].size(); j++) {
			ans = mn(ans, dp[(n - 2) % 2][j] + abs(t - G[n - 2][j].second));
		}
		cout << ans << endl;
	}

	return 0;
}