#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, m, x, k, y, a[N], b[N];
long long destroy(long long l, long long r) {
  long long s = r - l, ma = *max_element(a + l, a + r);
  bool al = (l && a[l - 1] > ma) || (r < n && a[r] > ma);
  if (x > y * k) {
    if (al) return y * s;
    if (k > s) return -1;
    return x + (s - k) * y;
  }
  if (al || s >= k) return s / k * x + s % k * y;
  return -1;
}
long long mana() {
  long long j = 0, s = -1, ma = 0;
  for (long long i = 0; i < n; i++)
    if (j < m && a[i] == b[j]) {
      if (s != -1) {
        long long d = destroy(s, i);
        if (d == -1) return -1;
        ma += d;
        s = -1;
      }
      j++;
    } else if (s == -1)
      s = i;
  if (s != -1) {
    long long d = destroy(s, n);
    if (d == -1) return -1;
    ma += d;
  }
  return j == m ? ma : -1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> x >> k >> y;
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0; i < m; i++) cin >> b[i];
  cout << mana() << '\n';
}
