#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<ctime>
#include<cctype>
#include<algorithm>
using namespace std;
const int INF=1e9+7;
typedef pair<int,int> pii;
typedef long long LL;
int vis[4010];
int a[30];
int main(){
//    freopen("D://input.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        memset(vis,0,sizeof(vis));
        int n,sum=0;scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        int zero=sum;
        vis[zero]=true;
        for(int i=0;i<n;i++){
            for(int j=sum*2-a[i];j>=0;j--){
                if(vis[j]){
                    vis[j+a[i]]=true;
                }
            }
            for(int j=a[i];j<=sum;j++){
                if(vis[j]){
                    vis[j-a[i]]=true;
                }
            }
        }
        /*
        for(int i=0;i<zero;i++){
            printf("%d",vis[i]);
        }printf("\n");
        for(int i=zero+1;i<=sum*2;i++){
            printf("%d",vis[i]);
        }printf("\n");
        */
        int q;scanf("%d",&q);
        while(q--){
            int s;scanf("%d",&s);
            if(s>sum){
                printf("NO\n");continue;
            }
            if(vis[s+zero]||vis[zero-s])printf("YES\n");
            else printf("NO\n");
        }
    }
//  printf("%.3f\n",(double)clock()/CLOCKS_PER_SEC);
    return 0;
}