#include<bits/stdc++.h>
using namespace std;
int f[300005],a[300005],n,m,h[300005];
bool q=false;
int find(int x){
    int sum=0;
    if(f[x]==x&&h[x]){
        sum=a[x];
    }else if(f[x]!=x){
        sum=a[x];
    }
	while(f[x]!=x){
	    x=f[x];
	    if(q){
	        int y=a[x];
	        sum=sum^y;
        }
    }
    if(q){
        return sum;
    }else{
        return x;
    }						
}
void join(int x,int y){
    int fx=find(x),fy=find(y);            
    if(fx!=fy) f[x]=y;                        
}
int main(){
    freopen("td.in","r",stdin);
    freopen("td.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        f[i]=i;
        cin>>a[i];
        h[i]=1;
    }
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>c;
        if(c==1){
            cin>>a>>b;
            join(a,b);
        }else{
            cin>>a;
            q=true;
            cout<<find(a)<<endl;
            q=false;
        }
    }
    return 0;
}