#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n, m;
ll A, B, C;
ll b[N], t[N];
ll check(ll T)
{
    ll tot1 = 0, tot2 = 0, cost = 0;
    for(int i = 1; i <= m; ++i) if(b[i] > T) tot1 += b[i] - T; else tot2 += T - b[i];
    for(int i = 1; i <= n; ++i) if(t[i] < T) cost += C * (T - t[i]);
    if(A > B) cost += tot1 * B; else cost += min(tot1, tot2) * A + (tot1 - min(tot1, tot2)) * B;     
    return cost;
}
int main()
{
    scanf("%lld%lld%lld", &A, &B, &C);
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) scanf("%lld", &t[i]);
    for(int i = 1; i <= m; ++i) scanf("%lld", &b[i]);
    if(C >= 10000000000000000ll)
    {
        ll lim = 10000000000000000ll;
        for(int i = 1; i <= n; ++i) lim = min(lim, t[i]);
        printf("%lld\n", check(lim));
        return 0;
    } 
    ll l = 1, r = 100010;
    while(r - l > 2)
    {
        ll lm = (2 * l + r) / 3, rm = (2 * r + l) / 3;
        ll val1 = check(lm), val2 = check(rm);
        if(val1 > val2) l = lm; else r = rm;
    }
    printf("%lld\n", min(min(check((2 * l + r) / 3), check((2 * r + l) / 3)), min(check(l), check(r))));
    return 0;
}