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

using namespace std;
typedef long long ll;

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<ll> a(n);
	for(int i = 0; i < n; ++i){ cin >> a[i]; }
	sort(a.begin(), a.end());
	int m;
	cin >> m;
	vector<ll> b(m), c(m);
	for(int i = 0; i < m; ++i){ cin >> b[i]; }
	for(int i = 0; i < m; ++i){ cin >> c[i]; }
	vector<ll> integral(n + 1);
	for(int i = 0; i < n; ++i){
		integral[i + 1] = integral[i] + a[i];
	}
	for(int i = 0; i < m; ++i){
		const int p = upper_bound(a.begin(), a.end(), b[i]) - a.begin();
		if(integral[p] >= c[i]){
			cout << "Yes\n";
		}else{
			cout << "No\n";
		}
	}
	return 0;
}