#include <bits/stdc++.h>
using namespace std;
signed main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  vector<long long> arr(n);
  multiset<long long> s;
  for (long long i = 0; i < n; i++) cin >> arr[i], s.insert(arr[i]);
  vector<long long> flag(n);
  bool bad = m < k;
  for (long long ii : {0, 1}) {
    long long nn, x;
    cin >> nn;
    if (nn < k) bad = true;
    for (long long i = 0; i < nn; i++) cin >> x, flag[--x] |= 1 << ii;
  }
  if (bad) {
    cout << "-1\n"
         << "\n";
    return 0;
  }
  array<vector<long long>, 4> vecs;
  for (long long i = 0; i < n; i++) vecs[flag[i]].push_back(arr[i]);
  for (long long i = 0; i < 4; i++) sort((vecs[i]).begin(), (vecs[i]).end());
  long long ans = LLONG_MAX, cur = 0;
  long long ptr = min((long long)vecs[3].size(), min(m, k));
  for (long long i = 0; i < ptr; i++)
    cur += vecs[3][i], s.erase(s.find(vecs[3][i]));
  for (long long ii : {1, 2})
    for (long long i = 0; i < k - ptr; i++)
      cur += vecs[ii][i], s.erase(s.find(vecs[ii][i]));
  if (2 * k - ptr > m or m - (2 * k - ptr) > s.size()) {
    cout << "-1\n";
    return 0;
  }
  multiset<long long> ps;
  for (long long i = 0; i < m - (2 * k - ptr); i++)
    cur += *s.begin(), ps.insert(*s.begin()), s.erase(s.begin());
  ans = cur;
  while (ptr--, ptr >= 0 and 2 * k - ptr <= m) {
    s.insert(vecs[3][ptr]), cur -= vecs[3][ptr];
    for (auto ii : {1, 2}) {
      if (k - ptr - 1 >= vecs[ii].size()) {
        cout << ans << "\n";
        return 0;
      }
      if (auto it = s.find(vecs[ii][k - ptr - 1]); it != s.end())
        s.erase(it), cur += vecs[ii][k - ptr - 1];
      else
        ps.erase(ps.find(vecs[ii][k - ptr - 1]));
    }
    while (ps.size() > m - (2 * k - ptr))
      cur -= *ps.begin(), s.insert(*ps.begin()), ps.erase(ps.begin());
    while (ps.size() < m - (2 * k - ptr))
      cur += *s.begin(), ps.insert(*s.begin()), s.erase(s.begin());
    while (ps.size() > 0 and s.size() > 0 and *prev(ps.end()) > *s.begin()) {
      long long psx = *prev(ps.end());
      long long sx = *s.begin();
      cur += sx - psx;
      ps.erase(ps.find(psx));
      s.erase(s.find(sx));
      ps.insert(sx);
      s.insert(psx);
    }
    ans = min(ans, cur);
  }
  cout << ans << "\n";
}
