#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename flow_t, typename cost_t>
struct PrimalDual {
  const cost_t TINF;
  struct edge {
    int to;
    flow_t cap;
    cost_t cost;
    int rev;
    bool isrev;
  };
  vector<vector<edge>> graph;
  vector<cost_t> potential, min_cost;
  vector<int> prevv, preve;
  PrimalDual(int V) : graph(V), TINF(numeric_limits<cost_t>::max()) {}
  void add_edge(int from, int to, flow_t cap, cost_t cost) {
    graph[from].push_back((edge){to, cap, cost, (int)graph[to].size(), false});
    graph[to].push_back(
        (edge){from, 0, -cost, (int)graph[from].size() - 1, true});
  }
  cost_t min_cost_flow(int s, int t, flow_t f) {
    int V = (int)graph.size();
    cost_t ret = 0;
    using Pi = pair<cost_t, int>;
    priority_queue<Pi, vector<Pi>, greater<Pi>> que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);
    while (f > 0) {
      min_cost.assign(V, TINF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while (!que.empty()) {
        Pi p = que.top();
        que.pop();
        if (min_cost[p.second] < p.first) continue;
        for (int i = 0; i < graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] -
                            potential[e.to];
          if (e.cap > 0 and min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if (min_cost[t] == TINF) return -1;
      for (int v = 0; v < V; v++) potential[v] += min_cost[v];
      flow_t addflow = f;
      for (int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for (int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }
  void output() {
    for (int i = 0; i < graph.size(); i++) {
      for (auto &e : graph[i]) {
        if (e.isrev) continue;
        auto &rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << " / "
             << rev_e.cap + e.cap << ")" << endl;
      }
    }
  }
};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int maxtime = 150;
  int n, m, k, c, d;
  cin >> n >> m >> k >> c >> d;
  PrimalDual<ll, ll> flow(maxtime * n + 5);
  int source = maxtime * n + 2, sink = maxtime * n + 3;
  auto get = [&](int idx, int t) { return t * n + idx; };
  for (int i = 0; i < n; i++) {
    for (int j = 0; j + 1 < maxtime; j++) {
      flow.add_edge(get(i, j), get(i, j + 1), flow.TINF, 0);
    }
  }
  for (int i = 0; i < (k); i++) {
    int a;
    cin >> a;
    a--;
    flow.add_edge(source, get(a, 0), 1, 0);
  }
  for (int i = 0; i < (m); i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    for (int j = 0; j + 1 < maxtime; j++) {
      for (int l = 1; l <= k; l++) {
        flow.add_edge(get(a, j), get(b, j + 1), 1, (2 * l - 1) * d);
        flow.add_edge(get(b, j), get(a, j + 1), 1, (2 * l - 1) * d);
      }
    }
  }
  for (int j = 0; j < (maxtime - 1); j++) {
    flow.add_edge(get(0, j), sink, flow.TINF, j * c);
  }
  cout << flow.min_cost_flow(source, sink, k) << endl;
  return 0;
}
