using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
namespace AtCoder
{
    class Program
    {
        static public long[] Sarray() { return ReadLine().Split().Select(long.Parse).ToArray(); }
        static public List<long> Slist() { return ReadLine().Split().Select(long.Parse).ToList(); }
        static long Mod = (long)1e9 + 7;
        static void Main(string[] args)
        {
            //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
            var XYABC = Sarray();
            var X = XYABC[0];
            var Y = XYABC[1];
            var A = XYABC[2];
            var B = XYABC[3];
            var C = XYABC[4];
            var Pi = Sarray();
            var Qi = Sarray();
            var Ri = Sarray();
            Array.Sort(Pi);Array.Reverse(Pi);
            Array.Sort(Qi);Array.Reverse(Qi);
            Array.Sort(Ri);Array.Reverse(Ri);
            var pq = new priority_queue<long>((l, r) => (int)(r - l));
            for (var i = 0; i < X; ++i)
                pq.insert(Pi[i]);
            for (var i = 0; i < Y; ++i)
                pq.insert(Qi[i]);
            for (var i = 0; i < C; ++i)
            {
                if (pq.top < Ri[i])
                {
                    pq.extract();
                    pq.insert(Ri[i]);
                }
            }
            var sum =0L;
            while (0 < pq.num)
                sum += pq.extract();
            WriteLine(sum);
            //Out.Flush();
        }
        class priority_queue<T>
        {
            Comparison<T> cmp;
            T[] A = new T[2000000];
            // var pq = new priority_queue<long>((l, r) => (int)(l - r));
            // とすれば値の大きいものから優先
            public priority_queue(Comparison<T> c)
            {
                cmp = c;
            }
            public int num { get; private set; } = 0;
            public T top { get { return A[0]; } }
            public void insert(T v)
            {
                A[num] = v;
                ++num;
                increaseKey(num);
            }
            void increaseKey(int i)
            {
                while (1 < i && 0 < cmp(A[i - 1], A[i / 2 - 1]))
                {
                    var t = A[i - 1];
                    A[i - 1] = A[i / 2 - 1];
                    A[i / 2 - 1] = t;
                    i = i / 2;
                }
            }
            public T extract()
            {
                if (num < 1) return default(T);
                var max = A[0];
                A[0] = A[num - 1];
                --num;
                maxHeapify(1);
                return max;
            }
            void maxHeapify(int i)
            {
                var H = num;
                var l = left(i);
                var r = right(i);
                var largest = 0;
                if (l <= H && 0 < cmp(A[l - 1], A[i - 1]))
                { largest = l; }
                else
                { largest = i; }
                if (r <= H && 0 < cmp(A[r - 1], A[largest - 1]))
                { largest = r; }
                if (largest != i)
                {
                    var t = A[i - 1];
                    A[i - 1] = A[largest - 1];
                    A[largest - 1] = t;
                    maxHeapify(largest);
                }
            }
            int left(int l) => l * 2;
            int right(int r) => r * 2 + 1;
        }
    }
}

Measured memory_bytes: 43884