#include<bits/stdc++.h>
using namespace std;
int n,m,fa[300010],sum[300010],sum2[300010];
void init(){
	for(int i=1;i<=n;i++){
        fa[i]=i;
        scanf("%d",&sum[i]);
    }
	return ;
}
int Find(int x){
	if(fa[x]!=x){
        fa[x]=Find(fa[x]);
        sum2[x]=sum[x]^sum2[fa[x]];
        return sum2[x];
    }
	return sum[x];
}
void Union(int x,int y){
	int a=x,b=Find(y);
	fa[a]=b;
    sum[a]=sum[a]^sum[fa[a]];
	return ;
}
int main(){
    freopen("td.in","r",stdin);
    freopen("td.out","w",stdout);
	scanf("%d%d",&n,&m);
	init(); 
	int x,y,z;
	for(int i=1;i<=m;i++){
	    scanf("%d%d",&x,&y);
	    if(x==1){
	        scanf("%d",&z);
            Union(y,z);
        }
        else{
            printf("%d\n",Find(y));
        }
    }
	return 0;
}