1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 #define rep(i, a, b)        for(int i(a); i <= (b); ++i)
 6 #define dec(i, a, b)        for(int i(a); i >= (b); --i)
 7 
 8 const int N = 52;
 9 
10 int T, q, n;
11 int f[N][N][N], c[5], a[N], Q;
12 
13 bitset <90> A[12];
14 
15 int check(int i, int j, int k){
16     rep(h, 0, 10) A[h].reset(); A[0][0] = 1;
17     rep(h, 1, n) if (h != i && h != j && h != k && a[h] <= 87) dec(p, 9, 0){
18         A[p + 1] |= A[p] << a[h];
19         if (A[10][87]) return 1;
20     }
21     
22     return 0;
23 }
24 
25 int main(){
26 
27     scanf("%d", &T);
28     while (T--){
29         scanf("%d", &n);
30         rep(i, 1, n) scanf("%d", a + i);
31         rep(i, 1, n) rep(j, i, n) rep(k, j, n) f[i][j][k] = check(i, j, k);
32         scanf("%d", &Q);
33         while (Q--){
34             scanf("%d%d%d", c + 1, c + 2, c + 3);
35             sort(c + 1, c + 4);
36             puts(f[c[1]][c[2]][c[3]] ? "Yes" : "No");
37         }
38     }
39     
40     return 0;
41     
42 }