using namespace std;
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<math.h>
#include<string.h>
int a[10001],ans[10001];
 
int find(int x,int ans[] )
{
	if(ans[x]==x)
	return x;
	else
	{
		int result=find(ans[x],ans);
		ans[x]=result;
		return result;
	}
}
 
void merge(int b,int c,int a[],int ans[])
{
	if(a[b]>a[c])
	ans[c]=b;
	//else  edit here
	else if(a[b]<a[c])
	ans[b]=c;
}
int main()
{
	int t,n,i,j,k,l;
	cin>>t;
	int x,y,z,q;
	while(t--)
	{
		cin>>n;
		for(i=1;i<n+1;i++)
		{
			cin>>a[i];
			ans[i]=i;
		}
		cin>>q;
		while(q--)
		{
			cin>>x;
			if(x==0)
			{
				cin>>y>>z;
				y=find(y,ans);
				z=find(z,ans);
				if(y==z)
				{
					cout<<"Invalid query!"<<endl;
					continue;
				}
				else
				merge(y,z,a,ans);
			}
			else
			{
				cin>>y;
 
				cout<<ans[y]<<endl;
 
			}
		}
	}
	return 0;
}
 

dXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdGRpbz4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxtYXRoLmg+CiNpbmNsdWRlPHN0cmluZy5oPgppbnQgYVsxMDAwMV0sYW5zWzEwMDAxXTsKCmludCBmaW5kKGludCB4LGludCBhbnNbXSApCnsKCWlmKGFuc1t4XT09eCkKCXJldHVybiB4OwoJZWxzZQoJewoJCWludCByZXN1bHQ9ZmluZChhbnNbeF0sYW5zKTsKCQlhbnNbeF09cmVzdWx0OwoJCXJldHVybiByZXN1bHQ7Cgl9Cn0KCQp2b2lkIG1lcmdlKGludCBiLGludCBjLGludCBhW10saW50IGFuc1tdKQp7CglpZihhW2JdPmFbY10pCglhbnNbY109YjsKCS8vZWxzZSAgZWRpdCBoZXJlCgllbHNlIGlmKGFbYl08YVtjXSkKCWFuc1tiXT1jOwp9CmludCBtYWluKCkKewoJaW50IHQsbixpLGosayxsOwoJY2luPj50OwoJaW50IHgseSx6LHE7Cgl3aGlsZSh0LS0pCgl7CgkJY2luPj5uOwoJCWZvcihpPTE7aTxuKzE7aSsrKQoJCXsKCQkJY2luPj5hW2ldOwoJCQlhbnNbaV09aTsKCQl9CgkJY2luPj5xOwoJCXdoaWxlKHEtLSkKCQl7CgkJCWNpbj4+eDsKCQkJaWYoeD09MCkKCQkJewoJCQkJY2luPj55Pj56OwoJCQkJeT1maW5kKHksYW5zKTsKCQkJCXo9ZmluZCh6LGFucyk7CgkJCQlpZih5PT16KQoJCQkJewoJCQkJCWNvdXQ8PCJJbnZhbGlkIHF1ZXJ5ISI8PGVuZGw7CgkJCQkJY29udGludWU7CgkJCQl9CgkJCQllbHNlCgkJCQltZXJnZSh5LHosYSxhbnMpOwoJCQl9CgkJCWVsc2UKCQkJewoJCQkJY2luPj55OwoJCQkJCgkJCQljb3V0PDxhbnNbeV08PGVuZGw7CiAKCQkJfQoJCX0KCX0KCXJldHVybiAwOwp9CiA=

MQo1CjMgNSAxMDAwMDAgNSA0CjkKMCAyIDMKMCAxIDUKMSAyIAoxIDEKMCAzIDUKMSAzCjEgMgoxIDUKMSAx

1
5
3 5 100000 5 4
9
0 2 3
0 1 5
1 2 
1 1
0 3 5
1 3
1 2
1 5
1 1