#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
#define XLM
using namespace std;
const int maxn=300010;
int f[maxn],val[maxn],g[maxn],n,m;

int ff(int x){
	if (x==f[x]) return x;
	else{
		ff(f[x]);
		g[x]^=g[f[x]];
		f[x]=f[f[x]];
		return f[x];
	}
}

void merge(int x,int y){
	g[ff(x)]=val[f[x]];
	f[f[x]]=y;
}

int main(){
	#ifdef XLM
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	#endif
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) scanf("%d",&val[i]),f[i]=i;
	while (m--){
		int type;
		scanf("%d",&type);
		if (type==1){
			int a,b;
			scanf("%d%d",&a,&b);
			merge(a,b);
		}
		else{
			int a;scanf("%d",&a);
			printf("%d\n",val[ff(a)]^g[a]);
		}
	}
}