#include<bits/stdc++.h>
using namespace std;
long long n,m,x,y,fa[300005],as,p;
long long f(long long x){
    if(fa[x]!=x){
        fa[x]=f(fa[x]);
    }
    return fa[x];
}
struct nm{
    long long v,id,nt;
}a[300005];
int main(){
    freopen("td.in","r",stdin);
    freopen("td.out","w",stdout);
    scanf("%lld%lld",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i].v);
        a[i].id=i;
    }
    while(m--){
        scanf("%lld%lld",&p,&x);
        if(p==1){
            scanf("%lld",&y);
            a[x].nt=y;
        }else{
            as=a[x].v;
            while(a[x].nt){
                as^=a[a[x].nt].v;
                x=a[x].nt;
            }
            printf("%lld\n",as);
        }
    }
    return 0;
}