import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format, std.datetime;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long X, Y, A, B, C;
    scan(X, Y, A, B, C);
    auto P = aryread();
    auto Q = aryread();
    auto R = aryread();
    auto pqr = P ~ Q ~ R;
    auto idx = new long[](A + B + C);
    idx[0 .. A] = 2;
    idx[A .. A + B] = 1;
    idx[A + B .. $] = 0;
    zip(pqr, idx).sort!"b<a"();
    auto remain = [-1, Y, X];
    long wild;
    long i;
    long ans;
    while (true)
    {
        if (remain[1] + remain[2] == wild)
        {
            writeln(ans);
            return;
        }
        if (remain[idx[i]] == 0)
        {
            i++;
            continue;
        }
        // writefln("%s %s %s %s", idx[i], pqr[i], remain, wild);
        if (idx[i] == 0)
            wild++;
        remain[idx[i]]--;
        ans += pqr[i];
        i++;
    }
}
