#include <bits/stdc++.h>
using namespace std;
const int maxn = 55 * 100, inf = 1e9;
struct Edge {
  int from, to, cap, flow, cost;
  Edge(int a, int b, int c, int d, int e) {
    from = a, to = b, cap = c, flow = d, cost = e;
  }
};
struct MCMF {
  int n, m, s, t;
  vector<Edge> edges;
  vector<int> G[maxn];
  int inq[maxn];
  int d[maxn];
  int p[maxn];
  int a[maxn];
  void init(int n) {
    this->n = n;
    for (int i = 0; i <= n; i++) G[i].clear();
    edges.clear();
  }
  void add(int from, int to, int cap, int cost) {
    edges.push_back(Edge(from, to, cap, 0, cost));
    edges.push_back(Edge(to, from, 0, 0, -cost));
    m = edges.size();
    G[from].push_back(m - 2);
    G[to].push_back(m - 1);
  }
  bool bellman(int s, int t, int& flow, int& cost) {
    for (int i = 0; i <= n; i++) d[i] = inf, inq[i] = 0;
    d[s] = 0;
    inq[s] = 1;
    p[s] = 0;
    a[s] = inf;
    queue<int> Q;
    Q.push(s);
    while (!Q.empty()) {
      int u = Q.front();
      Q.pop();
      inq[u] = 0;
      for (int i = 0; i < G[u].size(); i++) {
        Edge& e = edges[G[u][i]];
        if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
          d[e.to] = d[u] + e.cost;
          p[e.to] = G[u][i];
          a[e.to] = min(a[u], e.cap - e.flow);
          if (!inq[e.to]) {
            Q.push(e.to);
            inq[e.to] = 1;
          }
        }
      }
    }
    if (d[t] == inf) return false;
    flow += a[t];
    cost += d[t] * a[t];
    int u = t;
    while (u != s) {
      edges[p[u]].flow += a[t];
      edges[p[u] ^ 1].flow -= a[t];
      u = edges[p[u]].from;
    }
    return true;
  }
  int mincost(int s, int t) {
    int flow = 0, cost = 0;
    while (bellman(s, t, flow, cost))
      ;
    return cost;
  }
} solve;
int n, m;
int id(int u, int time) { return (u - 1) * 2 * 50 + time; }
int main() {
  int k, c, d, u, v;
  cin >> n >> m >> k >> c >> d;
  int S = 0, T = n * 50 * 2 + 1;
  solve.init(T + 1);
  for (int i = 1; i <= k; i++) {
    cin >> u;
    solve.add(S, id(u, 1), 1, 0);
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j < 100; j++) solve.add(id(i, j), id(i, j + 1), k, c);
  for (int i = 1; i <= 100; i++) solve.add(id(1, i), T, k, 0);
  for (int i = 1; i <= m; i++) {
    cin >> u >> v;
    for (int j = 1; j < 100; j++)
      for (int p = 1; p <= k; p++) {
        solve.add(id(u, j), id(v, j + 1), 1, c + (2 * p - 1) * d);
        solve.add(id(v, j), id(u, j + 1), 1, c + (2 * p - 1) * d);
      }
  }
  cout << solve.mincost(S, T);
}
