#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define INF (1ll<<62)
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
#define bug puts("===========");
const double pi=(acos(-1.0));
const double eps=1e-8;
const int inf=1e9+10;
const int maxn=6000+5;
const int mod=1e9+7;
/*===============================*/
ll a[maxn];
int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--){
        int n,m;
        memset(a,0,sizeof(a));
        a[3000]=1;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            int z;
            scanf("%d",&z);
            for(int j=0;j<=6000;j++)
                if(a[j])
                    a[j-z]=1;
            for(int j=6000;j>=0;j--)
                if(a[j])
                    a[j+z]=1;
        }
        scanf("%d",&m);
        while(m--){
            int z;
            scanf("%d",&z);
            if(a[z+3000]) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}