#![allow(unused_imports, dead_code, unused_macros, unused_variables, non_snake_case, unused_parens)]
use proconio::{input,marker::{Bytes, Chars, Usize1,Isize1}};
use std::ops::*;
use std::cmp::*;
use std::mem::swap;
use std::collections::*;

const MOD:u64 = 1_000_000_007;
const INF:usize = 0x3fff_ffff_ffff_ffff;

macro_rules! min {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::min($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::min($a, min!($($rest),+))}};}
macro_rules! max {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::max($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::max($a, max!($($rest),+))}};}
macro_rules! chmin {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_min = min!($($cmps),+);if $base > cmp_min {$base = cmp_min;true} else {false}}};}
macro_rules! chmax {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_max = max!($($cmps),+);if $base < cmp_max {$base = cmp_max;true} else {false}}};}
macro_rules! mulvec {($x:expr; $s:expr) => {vec![$x; $s]};($x:expr; $s0:expr; $( $s:expr );+) => {mulvec![vec![$x; $s0]; $( $s );+ ]};}
macro_rules! outputln {($var:expr)=>{println!("{}",$var)};($var:expr,$($vars:expr),+)=>{print!("{} ",$var);outputln!($($vars),+);};}
macro_rules! debug {($($a:expr),* $(,)*) => {eprintln!(concat!($("| ",stringify!($a), "={:?} "),*, "|"),$(&$a),*);};}


fn solve() {
    input! {
        n: usize,
        m: usize,
        l: usize,
        s: usize,
        e: usize,
		ABT:[(Usize1,Usize1,usize);m],
		T: [Usize1;l],
    }
	let mut ABT2 = HashMap::new();
	for (a,b,t) in ABT {
		if a==b{continue}
		chmin!(*ABT2.entry((a,b)).or_insert(usize::MAX), t);
	}
	let mut edge = vec!(vec![];n*2);
	for ((a,b),t) in ABT2 {
		edge[a].push((b, t));
		edge[b].push((a, t));
		edge[a+n].push((b+n, t));
		edge[b+n].push((a+n, t));
	}
	let mut toilet = vec![false;n*2];
	for t in T {
		toilet[t] = true;
	}
	let mut dist = vec![INF;n*2];
	let mut visit = vec![false;n*2];
	dist[0] = 0;
	let mut que = BinaryHeap::new();
	que.push((Reverse(0), 0));
	while let Some((Reverse(d), v)) = que.pop() {
		if visit[v] {continue}
		visit[v] = true;
		if toilet[v] && d <= s+e {
			let t2 = max!(s+1, d+1);
			if dist[v+n] > t2 {
				dist[v+n] = t2;
				que.push((Reverse(dist[v+n]), v+n));
			}
		}
		for &(w, t) in &edge[v] {
			if !visit[w] && d+t < dist[w] {
				dist[w] = d+t;
				que.push((Reverse(dist[w]), w));
			}
		}
	}
    if visit[n*2-1] {
		outputln!(dist[n*2-1]);
	}else{
		outputln!(-1);
	}
}

fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| solve()).unwrap()
        .join().unwrap();
}