#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
const int  N = 5000;
int n,m,a[N+10],dp[N+10],sum;
void DP() {
    memset(dp,0,sizeof(dp));
    dp[0]= 1;
    for(int i = 1; i<= n; i++) {
        for(int k=2;k;k--)
        for(int j = sum*2;j>=a[i];j--) {
            dp[j]|=dp[j-a[i]];
        }
    }
}
int main() {
   int T,x;
   scanf("%d",&T);
   while(T--) {
    scanf("%d",&n);sum=0;
    for(int i = 1;i <= n; i++) scanf("%d", &a[i]),sum+=a[i];
    DP();
    scanf("%d", &m);
    for(int i = 1; i<= m; i++) {
        scanf("%d", &x);
        int g = x+sum&&sum+x>=0&&dp[x+sum];
        if(g)printf("YES\n");
        else printf("NO\n");
    }
   }
    return 0;
}