#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long n, m;
  cin >> n >> m;
  unsigned long long x, k, y;
  cin >> x >> k >> y;
  vector<unsigned long long> arr, brr;
  map<unsigned long long, unsigned long long> umap;
  for (unsigned long long i = 0; i < n; i++) {
    unsigned long long a;
    cin >> a;
    arr.push_back(a);
    umap[a] = i;
  }
  for (unsigned long long i = 1; i <= m; i++) {
    unsigned long long a;
    cin >> a;
    brr.push_back(a);
  }
  if (arr.size() == brr.size() && arr == brr) {
    cout << 0 << endl;
    return 0;
  }
  if (arr.size() == brr.size() && arr != brr) {
    cout << -1 << endl;
    return 0;
  }
  unsigned long long sum = 0, st = 0, tc = 0, mc = 0, et = 0;
  for (unsigned long long i = 0; i < n; i++) {
    if (et == brr.size()) {
      if (arr[i] >= brr[et - 1]) {
        mc++;
        tc++;
      } else {
        tc++;
      }
      continue;
    }
    if (arr[i] == brr[et]) {
      if (tc >= k) {
        if (mc == 0)
          sum = sum + min(x * (tc / k) + y * (tc % k), y * (tc));
        else
          sum = sum + min(x * (tc / k) + y * (tc % k), y * (tc - k) + x);
      } else {
        if (mc != 0) {
          cout << -1 << endl;
          return 0;
        } else {
          sum = sum + y * tc;
        }
      }
      st = et;
      et++;
      tc = 0;
      mc = 0;
      continue;
    }
    if (arr[i] >= brr[st] && arr[i] >= brr[et]) {
      mc++;
      tc++;
    } else
      tc++;
  }
  if (et != brr.size()) {
    cout << -1 << endl;
    return 0;
  }
  if (tc >= k) {
    if (mc == 0)
      sum = sum + min(x * (tc / k) + y * (tc % k), y * (tc));
    else
      sum = sum + min(x * (tc / k) + y * (tc % k), y * (tc - k) + x);
  } else {
    if (mc != 0) {
      cout << -1 << endl;
      return 0;
    } else {
      sum = sum + y * tc;
    }
  }
  cout << sum << endl;
}
