#include<bits/stdc++.h>
using namespace std;
bitset<90>dp[11];
int n,m,q[3],a[100],ans[55][55][55];
bool check(int x, int y, int z){
for (int i = 0; i <= n; i++) dp[i].reset();
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
if ( i!=x && i!=y && i!=z ) //满足条件则说明i可以取
for (int t = 10; t >= 1; t--)
dp[t] |= dp[t - 1] << a[i];
if (dp[10][87] == 1) return true;
else return false;
}
int main(){
int t;
scanf("%d",&t);
while (t--){
memset(ans, 0, sizeof(ans));
scanf("%d",&n);
for (int i = 1; i <= n; i++) scanf("%d",&a[i]);
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
for (int k = j; k <= n; k++)
if (check(i, j, k))
ans[i][j][k] = 1;
scanf("%d",&m);
while (m--){
for (int i = 0; i < 3; i++) scanf("%d",&q[i]);
sort(q, q + 3);
if (ans[q[0]][q[1]][q[2]]) puts("Yes");
else puts("No");
}
}
return 0;
}