import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] first = br.readLine().split(" ", 5);
        int n = Integer.parseInt(first[0]);
        int m = Integer.parseInt(first[1]);
        int k = Integer.parseInt(first[2]);
        int s = Integer.parseInt(first[3]);
        int t = Integer.parseInt(first[4]);
        ArrayList<TreeSet<Integer>> floors = new ArrayList<>();
        ArrayList<HashMap<Integer, ArrayList<Integer>>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            floors.add(new TreeSet<>());
            graph.add(new HashMap<>());
        }
        for (int i = 0; i < m; i++) {
            String[] line = br.readLine().split(" ", 3);
            int a = Integer.parseInt(line[0]) - 1;
            int b = Integer.parseInt(line[1]);
            int c = Integer.parseInt(line[2]);
            floors.get(a).add(b);
            floors.get(a + 1).add(c);
            if (!graph.get(a).containsKey(b)) {
                graph.get(a).put(b, new ArrayList<>());
            }
            graph.get(a).get(b).add(c);
        }
        floors.get(0).add(s);
        floors.get(n - 1).add(t);
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(0, s, 0));
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (!floors.get(p.idx).contains(p.col)) {
                continue;
            }
            if (p.idx == n - 1 && p.col == t) {
                System.out.println(p.value);
                return;
            }
            floors.get(p.idx).remove(p.col);
            Integer up = floors.get(p.idx).higher(p.col);
            if (up != null) {
                queue.add(new Path(p.idx, up, p.value + up - p.col));
            }
            Integer down = floors.get(p.idx).lower(p.col);
            if (down != null) {
                queue.add(new Path(p.idx, down, p.value + p.col - down));
            }
            if (graph.get(p.idx).containsKey(p.col)) {
                for (int x : graph.get(p.idx).get(p.col)) {
                    queue.add(new Path(p.idx + 1, x, p.value));
                }
            }
        }
        System.out.println(-1);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int col;
        long value;
        
        public Path(int idx, int col, long value) {
            this.idx = idx;
            this.col = col;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            if (value == another.value) {
                return 0;
            } else if (value < another.value) {
                return -1;
            } else {
                return 1;
            }
        }
    }
}