#include<bits/stdc++.h>
#define MAXN 300010
namespace IO{
	char buf[1<<15],*fs,*ft;
	inline char gc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
	inline int qr(){
		int x=0,ch=gc();
		while(ch<'0'||ch>'9'){ch=gc();}
		while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=gc();}
		return x;}
}using namespace IO;
using namespace std;
int f[MAXN],sum[MAXN],N,M;//sum[x]记录的是到原父亲的答案 
int findf(int x){
	if(f[x]==x)return f[x];
	int ori=f[x];
	f[x]=findf(f[x]);
	if(f[x]!=ori)sum[x]^=sum[ori];
	return f[x];
}
int op,x,y;
int main(){
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	N=qr();M=qr();
	for(int i=1;i<=N;i++)sum[i]=qr(),f[i]=i;
	for(int i=1;i<=M;i++){
		op=qr();
		if(op==1){
			x=qr();y=qr();
			f[x]=y;
		}
		else if(op==2){
			x=qr();
			findf(x);
			if(f[x]!=x)printf("%d\n",sum[x]^sum[f[x]]);
			else printf("%d\n",sum[x]);
		}
	}
	return 0;
}