import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdio;

void main() {
    auto s = readln.split.map!(to!int);
    auto X = s[0];
    auto Y = s[1];
    auto A = s[2];
    auto B = s[3];
    auto C = s[4];
    auto P = readln.split.map!(to!long).array;
    auto Q = readln.split.map!(to!long).array;
    auto R = readln.split.map!(to!long).array;
    P.sort!"a > b";
    Q.sort!"a > b";
    R.sort!"a > b";
    auto S = P[0..X].dup ~ Q[0..Y].dup;
    long ans = 0;

    for (int i, j, cnt; cnt < X + Y; ++cnt) {
        if (j == C || S[i] >= R[j]) {
            ans += S[i];
            i += 1;
        } else {
            ans += R[j];
            j += 1;
        }
    }

    ans.writeln;
}