#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-;

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=;

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) {x=x*+c-''; c=getchar();}

}

const int maxn=;

int T,n,s[];

bool f[maxn][maxn][maxn],g[maxn][maxn][maxn];

bool get(int a,int b,int c)

{

    bitset<>dp[maxn][];

    int p[], sz=;

    for(int i=;i<=n;i++)

    {

        if(s[i]>) continue;

        if(i==a) continue;

        if(i==b) continue;

        if(i==c) continue;

        p[sz++]=s[i];

    }

    if(sz==) return ;

    dp[][][p[]]=;

    for(int i=;i<sz;i++)

    {

        dp[i][]|=dp[i-][]; dp[i][][p[i]]=;

        for(int j=;j<=;j++)

        {

            dp[i][j]|=dp[i-][j];

            dp[i][j]|=dp[i-][j-]<<p[i];

        }

        if(dp[i][][]==) return ;

    }

    return ;

}

int main()

{

    scanf("%d",&T);

    for(int i=;i<=T;i++)

    {

        memset(f,,sizeof f);

        memset(g,,sizeof g);

        scanf("%d",&n);

        for(int i=;i<=n;i++) scanf("%d",&s[i]);

        int Q; scanf("%d",&Q);

        while(Q--)

        {

            int op[]; scanf("%d%d%d",&op[],&op[],&op[]);

            sort(op,op+);

            if(g[op[]][op[]][op[]])

            {

                if(f[op[]][op[]][op[]]==)printf("No\n");

                else printf("Yes\n");

            }

            else

            {

                f[op[]][op[]][op[]]=get(op[],op[],op[]);

                if(f[op[]][op[]][op[]]==)printf("No\n");

                else printf("Yes\n");

                g[op[]][op[]][op[]]=;

            }

        }

    }

    return ;

}