#include<iostream>
#include<unordered_set>
using namespace std;

int main() {
	int t;
	cin>>t;
	int n,q,query;
	
	int arr[100003];
	unordered_set<int>s;

	for(int j=0;j<t;j++){
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>arr[i];
			s.insert(arr[i]);
		}
		cin>>q;
		for(int i=0;i<q;i++){
			cin>>query;
			if(s.find(query)==s.end()){
				cout<<"No"<<endl;
			}
			else{
				cout<<"Yes"<<endl;
			}
		}
	}
	return 0;
}