#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

bool in_range(int a, int b, int t) {
  return t >= a && t <= b;
}

int main() {
  int n; cin >> n;
  vector<int> pops(n);
  vector<int> towns(n);
  int m;
  vector<int> ms(n);
  vector<int> rs(n);
  for (int i = 0; i < n; i++) {
    cin >> pops[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> towns[i];
  }
  cin >> m;

  for (int i = 0; i < m; i++) {
    cin >> ms[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> rs[i];
  }

  int p = -1;
  int mx = 0;
  for (int i = 0; i < m; i++) { // clouds
    int S = ms[i]-rs[i];
    int E = ms[i]+rs[i];
    /* cout << S << " " << E << endl; */
    for (int j = 0; j < n; j++) { // towns
      /* cout << in_range(S, E, towns[j]) << endl; */
      if (in_range(S, E, towns[j]) && pops[j] > mx) {
        p = i;
        mx = pops[j];
      }
    }
    /* cout << p << endl; */
    /* cout << i << endl; */
    /* cout << mx << endl; */
    int s = mx;
    for (int i = 0; i < n; i++) {
      if (i != p) {
        s += pops[i];
      }
    }
    cout << s << endl;
  }
  return 0;
}