#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int n, m, tot = 1e5, t[N], b[N];
long long ans = 1e18, A, B, C, ctp[N], stp[N], cbp[N], sbp[N], cbs[N], sbs[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> A >> B >> C >> n >> m;
    A = min(A, B);
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
        ctp[t[i]]++;
        stp[t[i]] += t[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i];
        cbp[b[i]]++;
        sbp[b[i]] += b[i];
        cbs[b[i]]++;
        sbs[b[i]] += b[i];
    }
    for (int i = 1; i <= tot; i++) {
        cbp[i] += cbp[i - 1];
        sbp[i] += sbp[i - 1];
        ctp[i] += ctp[i - 1];
        stp[i] += stp[i - 1];
    }
    for (int i = tot; i >= 1; i--) {
        cbs[i] += cbs[i + 1];
        sbs[i] += sbs[i + 1];
    }
    for (int i = 1; i <= tot; i++) {
        long long a = cbp[i] * i - sbp[i];
        long long b = sbs[i] - cbs[i] * i;
        long long c = ctp[i] * i - stp[i];
        if (C >= (long long)1e16 && c > 0) {
            continue;
        }
        ans = min(ans, min(a, b) * A + max(b - a, 0ll) * B + c * C);
    }
    cout << ans << '\n';

    return 0;
}