#include <bits/stdc++.h>   
#define MAXN 100010
#define MAXN2 500000
using namespace std;
int quan[MAXN2*2],s[MAXN2*2],fa[MAXN2*2];
int n,m,num=0,hhh;
int find(int now){
    if(fa[now]!=now) hhh=find(fa[now]);
    else hhh=fa[now];
    s[now]=s[now]^s[fa[now]];
    fa[now]=hhh;
    return fa[now];
}
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",&quan[i]);
        fa[i]=i;
    }
    for(int i=1;i<=m;i++){
        int id,x,y;
        scanf("%d",&id);
        if(id==2){
            scanf("%d",&x);
            int hh=find(x);
            printf("%d\n",s[x]^quan[hh]);
        }
        else{
            scanf("%d%d",&x,&y);
            fa[x]=y;
            s[x]=quan[x];
        }
    }
    return 0;
}