#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using i128=__int128;
constexpr int N=1e5+5;
long long unsigned aa,bb,cc; 
int n,m;
long long unsigned t[N],b[N];
i128 ans;
void out(i128 v){
    if(v<0) putchar('-'),v=-v;
    if(v>9) out(v/10);
    putchar((v%10)|48);
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    i128 ts{0},bs1{0},bs2{0};
    ans=(i128(0x3f3f3f3f3f3f3f3fll)<<i128(63))+0x3f3f3f3f3f3f3f3fll;
    // out(ans),putchar('\n');
    cin>>aa>>bb>>cc>>n>>m;
    for(int i{1};i<=n;++i){
        cin>>t[i];
    }
    for(int i{1};i<=m;++i){
        cin>>b[i];
        bs2+=b[i];
    }
    sort(t+1,t+n+1);
    sort(b+1,b+m+1);
    for(i128 mxb{0},i{0},j{0};mxb<=100000;++mxb){
    // for(int mxb{0},i{0},j{0};mxb<=10;++mxb){
        while(i<n&&t[i+1]<=mxb) ++i,ts+=t[i];
        while(j<m&&b[j+1]<=mxb) ++j,bs1+=b[j],bs2-=b[j];
        i128 sum=cc*(1ll*i*mxb-ts);
        i128 d1=1ll*j*mxb-bs1,d2=bs2-1ll*(m-j)*mxb;
        if(aa<bb) sum+=min(d1,d2)*aa+(d2-min(d1,d2))*bb;
        else sum+=d2*bb;
        ans=min(ans,sum);
        // cerr<<"mxb="<<mxb<<",ts="<<ts<<",bs1="<<bs1<<",bs2="<<bs2<<",SUM="<<sum<<'\n';
    }
    out(ans),puts("");
    return 0;
}