/*#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e9+10;
const int maxn=1e6+100;
int n,s,k;
int nxt[maxn][20],pos[maxn],pre[maxn];
int sh[maxn];
int main()
{
IOS
cin>>n>>s>>k;
pos[1]=0;
for(int i=2;i<=n;i++){
cin>>pos[i];
pos[i]+=pos[i-1];
}
for(int i=1;i<=n;i++){
cin>>pre[i];
pre[i]+=pre[i-1];
//cout<<pre[i]<<' ';
}
pre[n+1]=pre[n];
for(int i=1;i<=n;i++){
int id=upper_bound(pos+i,pos+n+1,pos[i]+k)-pos;
id--;
sh[i]=id;
nxt[i][0]=upper_bound(pos+id,pos+n+1,pos[id]+k)-pos;
//cout<<nxt[i][0]<<' ';
}
for(int i=1;i<20;i++){
for(int id=1;id<=n;id++){
nxt[id][i]=nxt[nxt[id][i-1]][i-1];
if(!nxt[id][i])nxt[id][i]=n+1;
}
}
pair<int,int>mx={-1,-1};
for(int l=1;l<=n;l++){
int r=l;
for(int i=0;i<20;i++){
if(((1<<i)&s))r=nxt[r][i];
}
//cout<<l<<' '<<r<<endl;
mx=max(mx,{pre[r-1]-pre[l-1],l});
}
vector<int>ans;
int l=mx.second;
while(l<=n&&s){
ans.pb(sh[l]);
l=nxt[l][0];
s--;
}
cout<<ans.size()<<endl;
for(auto x:ans)cout<<x<<' ';cout<<endl;
return 0;
}
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e9+10;
const ll maxn=10050;
ll n,m,k,a,b;
ll s[maxn],val[maxn],t[maxn];
ll dp[maxn][2][2][2];
bool vis[maxn][maxn][2][2];
ll solve(ll day,ll sc,ll f1,ll f2){
if(vis[day][sc][f1][f2])return dp[day][sc][f1][f2];
vis[day][sc][f1][f2]=1;
ll &ans=dp[day][sc][f1][f2];
ans=-1e9;
if(sc==m)return ans=0;
if(day==n)return ans=solve(day,sc+1,f1,0)-b-a*f2;
ans=max(ans,solve(day,sc+1,f1,0)-b-a*f2);
ans=max(ans,solve(day+1,sc,0,f2)-b-a*f1);
if(s[day]==t[sc])ans=max(ans,val[s[day]]+solve(day+1,sc+1,1,1));
return ans;
}
int main()
{
IOS
cin>>k>>n>>m>>a>>b;
for(ll i=1;i<=k;i++)cin>>val[i];
for(ll i=0;i<n;i++)cin>>s[i];
for(ll i=0;i<m;i++)cin>>t[i];
a=-a;
b=-b;
for(ll i=0;i<n+10;i++){
for(ll j=0;j<2;j++){
for(ll k=0;k<2;k++){
for(ll l=0;l<2;l++){
dp[i][j][k][l]=-1e9;
}
}
}
}
int cur=0;
for(ll day=0;day<n+10;day++){
for(ll f1=0;f1<2;f1++){
for(ll f2=0;f2<2;f2++){
dp[day][cur][f1][f2]=0;
}
}
}
for(ll sc=m-1;sc>=0;sc--){
cur=1-cur;
for(ll day=n;day>=0;day--){
for(ll f1=0;f1<2;f1++){
for(ll f2=0;f2<2;f2++){
ll &ans=dp[day][cur][f1][f2];
ans=-1e9;
if(day==n){ans=dp[day][1-cur][f1][0]-b-a*f2;continue;}
ans=max(ans,dp[day][1-cur][f1][0]-b-a*f2);
ans=max(ans,dp[day+1][cur][0][f2]-b-a*f1);
if(s[day]==t[sc])ans=max(ans,dp[day+1][1-cur][1][1]+val[s[day]]);
}
}
}
}
ll ans=-a-b*m;
for(ll i=0;i<=n;i++){
ans=max(ans,dp[i][cur][1][1]);
}
cout<<ans<<endl;
return 0;
}
