#include<bits/stdc++.h>
    using namespace std;
    const int maxn=300010;
    int n,m,p,a,b;
    int f[maxn],t[maxn],v[maxn];
//    int Find(int x){
//    	if(f[x]==x){t[x]=0;return x;}
    	int ff=f[x];
    	f[x]=Find(f[x]);
    	t[x]=v[x]^t[ff];
    	v[x]=t[x];
    	return f[x];
    }
    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++){
    		scanf("%d",&p);
    		if(p==1)scanf("%d%d",&a,&b),f[a]=b;
    		else{
    			scanf("%d",&a),Find(a);
    			printf("%d\n",t[a]^v[f[a]]);
    		}
    	}
    	return 0;
    }