#include <iostream>
using namespace std;
const int INF = 1e9;
const int KMAX = 1000;
const int NMAX = 5000;
int K, N, M, A, B;
int dp[NMAX + 5][NMAX + 5][2][2];
int v[KMAX + 5], s[NMAX + 5], t[NMAX + 5];
int main()
{
cin >> K >> N >> M >> A >> B;
for(int i = 1; i <= K; i++)
cin >> v[i];
for(int i = 1; i <= N; i++)
cin >> s[i];
for(int i = 1; i <= M; i++)
cin >> t[i];
for(int i = 1; i <= N + 1; i++)
for(int j = 0; j <= M; j++)
for(int x = 0; x < 2; x++)
for(int y = 0; y < 2; y++)
dp[i][j][x][y] = -INF;
for(int i = 1; i <= N + 1; i++)
dp[i][0][0][0] = 0;
for(int i = 1; i <= N; i++)
{
if(i == 3)
i++, i--;
for(int j = 0; j <= M - 1; j++)
{
///Skip concert
dp[i][j + 1][0][1] = max(dp[i][j + 1][0][1], dp[i][j][0][0] + A + B);
dp[i][j + 1][0][1] = max(dp[i][j + 1][0][1], dp[i][j][0][1] + B);
dp[i][j + 1][1][1] = max(dp[i][j + 1][1][1], dp[i][j][1][0] + A + B);
dp[i][j + 1][1][1] = max(dp[i][j + 1][1][1], dp[i][j][1][1] + B);
///Skip day
dp[i + 1][j][1][0] = max(dp[i + 1][j][1][0], dp[i][j][0][0] + A + B);
dp[i + 1][j][1][0] = max(dp[i + 1][j][1][0], dp[i][j][1][0] + B);
dp[i + 1][j][1][1] = max(dp[i + 1][j][1][1], dp[i][j][0][1] + A + B);
dp[i + 1][j][1][1] = max(dp[i + 1][j][1][1], dp[i][j][1][1] + B);
///Attend
if(s[i] == t[j + 1])
{
dp[i + 1][j + 1][0][0] = max(dp[i + 1][j + 1][0][0], dp[i][j][0][0] + v[t[j + 1]]);
dp[i + 1][j + 1][0][0] = max(dp[i + 1][j + 1][0][0], dp[i][j][1][0] + v[t[j + 1]]);
dp[i + 1][j + 1][0][0] = max(dp[i + 1][j + 1][0][0], dp[i][j][0][1] + v[t[j + 1]]);
dp[i + 1][j + 1][0][0] = max(dp[i + 1][j + 1][0][0], dp[i][j][1][1] + v[t[j + 1]]);
}
}
}
int res = A + M * B;
for(int i = 1; i <= N + 1; i++)
for(int x = 0; x < 2; x++)
for(int y = 0; y < 2; y++)
res = max(res, dp[i][M][x][y]);
cout << res << '\n';
return 0;
}
