#include <bits/stdc++.h>
using namespace std;
const int N=600010;
int fa[N],d[N],n,m,a[N];
int find(int x)
{
	if(fa[x]==x) return x;
	else if (fa[fa[x]]==fa[x]) return fa[x];
	else
	{
		int cnt=fa[x];
		fa[x]=find(fa[x]);
		d[x]=d[x]^d[cnt]^a[cnt];
		return fa[x];
	}
}
int main() {
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	cin>>n>>m;
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	for (int i=1;i<=n;i++)
	{
		fa[i]=i;
		d[i]=a[i];
	}
	while (m--)
	{
		int op,x,y;
		scanf("%d%d",&op,&x);
		if (op==1)
		{
			scanf("%d",&y);
			int fy=find(y);
			fa[x]=fa[fy];
			d[x]=d[x]^d[y];
		}
		else
		{
			find(x);
			printf("%d\n",d[x]);
		}
	}
}