#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define INF 1e9

struct Edge {
  int to;
  int dist;
  Edge(int to, int dist) : to(to), dist(dist) {}
  bool operator=(const Edge &rhs) const {
    return to == rhs.to;
  }
};

vector<int> dijkstra(int N, int s, vector<vector<Edge>> &graph) {
  vector<int> distance(N, INF);
  vector<int> from(N, -1);
  priority_queue<pair<int, int>,
		 vector<pair<int, int>>,
		 greater<pair<int, int>>> q;
  distance[s] = 0;
  q.push({0, s});
  while (!q.empty()) {
    pair<int, int> p = q.top();
    q.pop();
    int path_now = p.first;
    int p_now = p.second;
    if (distance[p_now] < path_now)
      continue;
    for (Edge e : graph[p_now]) {
      int path_new = path_now + e.dist;
      int p_new = e.to;
      if (path_new < distance[p_new]) {
	distance[p_new] = path_new;
	from[p_new] = p_now;
	q.push({path_new, p_new});
      }
    }
  }
  return distance;
}

int main() {
  int n, m, l, s, e;
  cin >> n >> m >> l >> s >> e;
  vector<vector<Edge>> g(n);
  rep(i, m) {
    int a, b, t;
    cin >> a >> b >> t;
    a--; b--;
    g[a].push_back(Edge(b, t));
    g[b].push_back(Edge(a, t));
  }
  vector<int> t(n, 0);
  rep(i, l) {
    int ti;
    cin >> ti;
    ti--;
    t[ti] = 1;
  }
  vector<int> d = dijkstra(n, 0, g);
  int ans = INF;
  if (d[n-1] < s)
    ans = s + 1;
  else if (d[n-1] <= s + e)
    ans = d[n-1] + 1;
  rep(i, n) {
    if (t[i] == 1) {
      vector<int> ret = dijkstra(n, i, g);
      if (d[i] < s)
	ans = min(s + 1 + ret[n-1], ans);
      else if (d[i] >= s && d[i] <= s + e)
	ans = min(d[i] + 1 + ret[n-1], ans);
    }
  }
  if (ans == 1e9)
    cout << -1 << endl;
  else
    cout << ans << endl;
  return 0;
}