#include <iostream>
#include <set>
#include <map>

using namespace std;



int main() {
 int T;
 cin>>T;
 set <int> se;
 map <int,int> mp;
 int n;
 while (T--){
  cin>>n;
  for (int i = 0; i < n; i++){
   int value;
   cin>>value;
   mp[value]++;
  }
  for (auto it : mp){
   se.insert(it.first);
  }
  int q;
  cin>>q;
  while (q--){
   int value;
   cin>>value;
   int count = 0;
   if (se.find(value) != se.end()){
    cout<<"YES";
   }
   else {
    cout<<"NO";
   }
  }
 }
}