#include<bits/stdc++.h>
using namespace std;
const int N=300005;
int n,m,a[N],num[N],fa[N];
int find(int x){
    int fx=(fa[x]==x?x:find(fa[x]));
    num[x]^=num[fa[x]];
    fa[x]=fx;
    return fa[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",&a[i]); num[i]=a[i];
        fa[i]=i;
    }
    while(m--){
        int op,x,y; scanf("%d",&op);
        if(op==1){
            scanf("%d%d",&x,&y);
            fa[x]=y;
            num[x]=a[x];
        } 
        else{
            scanf("%d",&x);
            int fx=find(x); 
            printf("%d\n",num[x]^a[fx]);
        }
    }
    return 0;
}