#pragma comment(linker, "/STACK:1024000000,1024000000")#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<bitset>#include<iostream>using namespace std;typedef long long LL;const double pi=acos(-1.0),eps=1e-6;void File(){    freopen("D:\\in.txt","r",stdin);    freopen("D:\\out.txt","w",stdout);}template <class T>inline void read(T &x){    char c=getchar(); x=0;    while(!isdigit(c)) c=getchar();    while(isdigit(c)) {x=x*10+c-‘0‘; c=getchar();}}const int maxn=60;int T,n,s[60];bool f[maxn][maxn][maxn],g[maxn][maxn][maxn];bool get(int a,int b,int c){    bitset<90>dp[maxn][12];    int p[60], sz=0;    for(int i=1;i<=n;i++)    {        if(s[i]>87) continue;        if(i==a) continue;        if(i==b) continue;        if(i==c) continue;        p[sz++]=s[i];    }    if(sz==0) return 0;    dp[0][1][p[0]]=1;    for(int i=1;i<sz;i++)    {        dp[i][1]|=dp[i-1][1]; dp[i][1][p[i]]=1;         for(int j=2;j<=10;j++)        {            dp[i][j]|=dp[i-1][j];            dp[i][j]|=dp[i-1][j-1]<<p[i];        }        if(dp[i][10][87]==1) return 1;    }    return 0;}int main(){    scanf("%d",&T);    for(int i=1;i<=T;i++)    {        memset(f,0,sizeof f);        memset(g,0,sizeof g);        scanf("%d",&n);        for(int i=1;i<=n;i++) scanf("%d",&s[i]);        int Q; scanf("%d",&Q);        while(Q--)        {            int op[3]; scanf("%d%d%d",&op[0],&op[1],&op[2]);            sort(op,op+3);            if(g[op[0]][op[1]][op[2]])            {                if(f[op[0]][op[1]][op[2]]==0)printf("No\n");                else printf("Yes\n");            }            else            {                f[op[0]][op[1]][op[2]]=get(op[0],op[1],op[2]);                if(f[op[0]][op[1]][op[2]]==0)printf("No\n");                else printf("Yes\n");                g[op[0]][op[1]][op[2]]=1;            }        }    }    return 0;}