#include "stdio.h"
#include "math.h"
#include "queue"
#include "stdlib.h"
#include "string.h"
#include "algorithm"
#include "iostream"
#define N 100005
#define inf 2147483646
#define eps 1e-8
#define pi acos(-1.0)
using namespace std;
typedef long long LL;
struct dd
{
    int num,id;
};
int vis[N],w[25];
int n;
void bfs()
{
    dd p1,p2;
    queue<dd>q;
    p1.num=0;
    p1.id=0;
    q.push(p1);
    while(!q.empty())
    {
        p1=q.front();
        q.pop();
        if(p1.id<n)
        {
            p2.num=p1.num+w[p1.id];
            p2.id=p1.id+1;
            if(!vis[p2.num])
            {
                vis[p2.num]=1;
                q.push(p2);
            }
            p2.num=abs(p1.num-w[p1.id]);
            p2.id=p1.id+1;
            if(!vis[p2.num])
            {
                vis[p2.num]=1;
                q.push(p2);
            }
            p2.num=p1.num;
            p2.id=p1.id+1;
            q.push(p2);
        }
    }
}
int main()
{
    int t,i,m,x;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(i=0; i<n; i++)
            cin>>w[i];
        memset(vis,0,sizeof(vis));
        bfs();
        cin>>m;
        while(m--)
        {
            cin>>x;
            if(vis[x])
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
        }
    }
    return 0;
}