#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
typedef vector<pl> vp;
#define nl "\n"
#define fr first
#define sc second
#define pb push_back
#define all(x) x.begin(), x.end()
#define fur(i, a, b) for(ll i = a; i <= b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= b; --i)
#define pv(x) for(auto k : x){cout << k << " ";} cout << nl
ll K, n, m, A, B;
vl v, s, t;
/*
There are K types of events
We know the values of each type of event
N of them will occur
M of them you want to attend (in the given order, you can attend a type of event more than once)
if you miss x consecutive normal events, you will lose points
if you miss x consecutive special events, you will lose points
now, what is the maximum score you can get?
*/
void solve(){
// k = 1, n < m
ll tot = n * v[1];
ll rep = ((m-n) * B) + A;
cout << (tot + rep) << nl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> K >> n >> m >> A >> B;
v.resize(K + 1);
s.resize(n + 1);
t.resize(m + 1);
fur(i, 1, K)
cin >> v[i];
fur(i, 1, n)
cin >> s[i];
fur(i, 1, m)
cin >> t[i];
solve();
return 0;
}
