#include <bits/stdc++.h>
using namespace std;
const int MX = 2e5 + 5;
int n, m, a[MX], b[MX];
long long int x, k, y;
vector<int> pos;
long long int solve(int L, int R) {
  int num = R - L - 1;
  bool berserk;
  int tmp = 0;
  for (int i = L + 1; i < R; i++) tmp = max(tmp, a[i]);
  berserk = (tmp < a[L] || tmp < a[R]);
  if (num < k) {
    if (berserk)
      return num * y;
    else
      return -1;
  }
  if (k * y > x) {
    int fireball = num / k;
    num %= k;
    return x * fireball + y * num;
  }
  if (berserk)
    return num * y;
  else
    return x + (num - k) * y;
}
int main() {
  cin.tie(nullptr), ios::sync_with_stdio(false);
  cin >> n >> m >> x >> k >> y;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  int p = 1;
  pos.push_back(0);
  for (int i = 1; i <= m; i++) {
    while (a[p] != b[i] && p <= n) p++;
    if (p > n) {
      cout << "-1";
      return 0;
    }
    pos.push_back(p);
  }
  pos.push_back(n + 1);
  long long int ans = 0;
  for (int i = 0; i < (int)pos.size() - 1; i++) {
    long long int tmp = solve(pos[i], pos[i + 1]);
    if (tmp == -1) {
      cout << "-1";
      return 0;
    }
    ans += tmp;
  }
  cout << ans;
}
