#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back

#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)

int N, M;
long long p[1000010], b[1000010];

int main() {
    memset(p, 0, sizeof(p));
    
    cin >> N;
    for_(i,0,N) {
        long long a; cin >> a;
        p[a] += a;
    }
    
    for_(i,1,1000010) p[i] += p[i - 1];
    
    cin >> M;
    for_(i,0,M) cin >> b[i];
    
    for_(i,0,M) {
        ll c; cin >> c;
        if (c <= p[b[i]]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}