#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=300000;
int n,m,w,t,a,b,f[maxn],v[maxn];
int Find(int x){
	if(f[x]==x)return x;
	return Find(f[x]);
}
int Cal(int x){
	w^=v[x];
	if(f[x]!=x)Cal(f[x]);
	else return w;
}
int main(){
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&v[i]),f[i]=i;
	for(int i=1;i<=m;i++){
		w=0;
		scanf("%d",&t);
		if(t==1)scanf("%d%d",&a,&b),f[a]=b;
		else{
			scanf("%d",&a),Cal(a),printf("%d\n",w);
		}
	}
	return 0;
}