#include <bits/stdc++.h>
const double PI = acos(-1.);
const long long inf = 10000000000000LL;
const int MAXN = 100000 + 13;
using namespace std;
int c[4], n, m, a[1000], b[1000];
int main() {
  int tmp = 0, tmp2 = 0, res = 0;
  for (int i = 0; i < 4; ++i) cin >> c[i];
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    tmp += min(a[i] * c[0], c[1]);
  }
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
    tmp2 += min(b[i] * c[0], c[1]);
  }
  tmp = min(tmp, c[2]);
  tmp2 = min(tmp2, c[2]);
  cout << min(tmp + tmp2, c[3]) << endl;
  return 0;
}
