#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 1e9

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que;

const double EPS = 1.0e-8;

const double eps = 1.0e-8;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

const int maxn = ;

const int  maxm = ;

//next_permutation

int t;

int n;

int num[];

bitset<> f[];

int dp[][][];

int ques[];

bool ok(int a, int b, int c, int x)

{

        if (x == a || x == b || x == c)

        {

                return true;

        }

        return false;

}

void getans()

{

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

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

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

                        {

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

                                {

                                        f[l].reset();

                                }

                                f[][] = ;

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

                                {

                                        for (int p = ; p >= ; p--)

                                        {

                                                if (ok(i, j, k, l) || num[l] > )

                                                {

                                                        continue;

                                                }

                                                f[p] |= f[p - ] << num[l];

                                        }

                                }

                                if (f[][])

                                {

                                        dp[i][j][k] = ;

                                }

                                else

                                {

                                        dp[i][j][k] = ;

                                }

                        }

}

int main()

{

        cin >> t;

        while (t--)

        {

                //mem(dp, 0);

                scanf("%d", &n);

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

                {

                        scanf("%d", &num[i]);

                }

                getans();

                int m;

                int a, b, c;

                scanf("%d", &m);

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

                {

                        scanf("%d%d%d", &ques[], &ques[], &ques[]);

                        sort(ques + , ques + );

                        if (dp[ques[]][ques[]][ques[]])

                        {

                                printf("Yes\n");

                        }

                        else

                        {

                                printf("No\n");

                        }

                }

        }

}