#include <bits/stdc++.h>
using namespace std;
int main() {
  typedef int* ins;
  int n, m, c[4], i, nc, mc, minm, minn, fminn = 0, fminm = 0;
  for (i = 0; i < 4; i++) {
    cin >> c[i];
  }
  cin >> n >> m;
  ins tn = new int[n];
  ins tm = new int[m];
  for (i = 0; i < n; i++) {
    cin >> tn[i];
  }
  for (i = 0; i < m; i++) {
    cin >> tm[i];
  }
  sort(tn, tn + n);
  sort(tm, tm + m);
  nc = n * c[1];
  mc = m * c[1];
  for (i = 0; i < n; i++) {
    fminn = nc - c[1] + c[0] * tn[i];
    if (fminn < nc)
      nc = fminn;
    else
      break;
  }
  for (i = 0; i < m; i++) {
    fminm = mc - c[1] + c[0] * tm[i];
    if (fminm < mc)
      mc = fminm;
    else
      break;
  }
  minm = min(mc, c[2]);
  minn = min(nc, c[2]);
  cout << min(c[3], minm + minn) << endl;
  return 0;
}
