#include <bits/stdc++.h>
using namespace std;
char graph[105][105];
int xr[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int yc[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int rr[] = {0, -1, 0, 1};
int cc[] = {-1, 0, 1, 0};
int main() {
  int c1, c2, c3, c4, n, m, t1, t2, t3, t4;
  cin >> c1 >> c2 >> c3 >> c4 >> n >> m;
  t1 = t2 = t3 = 0;
  int sum = 0, x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    t1 += (x * c1);
    t2 += min(x * c1, c2);
  }
  t3 = c3;
  sum += (min(t3, min(t1, t2)));
  t1 = t2 = t3 = 0;
  for (int i = 0; i < m; i++) {
    cin >> x;
    t1 += (x * c1);
    t2 += min(x * c1, c2);
  }
  t3 = c3;
  sum += (min(t3, min(t1, t2)));
  printf("%d\n", min(sum, c4));
  return 0;
}
