#include<iostream>
#include<cstdio>
using namespace std;
int n,m,a[300010],f[300010],ans[300010];
int find(int x)
{
    if(f[x]==x) return x;
    int p=find(f[x]);
    ans[x]=a[f[x]]^ans[x]^ans[f[x]];
    f[x]=p;
    return f[x];
}
void merge(int x,int y)
{
    int fy=find(y);
    ans[x]=a[x]^ans[y];
    f[x]=fy;
}
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]);
        f[i]=i;
        ans[i]=a[i];
    } 
    for(int i=1;i<=m;i++)
    {
        int p;
        scanf("%d",&p);
        if(p==1)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            merge(x,y);
        }
        else
        {
            int x;
            scanf("%d",&x);
            find(x);
            printf("%d\n",ans[x]);
        }
    }
    return 0;
}