#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAXN 300010

	int n,m;
	int val[MAXN],fa[MAXN]={0},w[MAXN]={0};

int find(int x)
{
	if(fa[x]==x)
		return fa[x];
	int fax=find(fa[x]);
	if(fa[x]!=fax||val[x]!=w[x])
		val[x]^=val[fa[x]];
	return fa[x]=fax;
}

void merge(int x,int y)  //x is father
{
	int fax=find(x);
	int fay=find(y);
	//val[y]^=val[x];
	fa[fay]=fa[fax];
}

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",&w[i]),fa[i]=i,val[i]=w[i];
	for(int i=1;i<=m;i++)
	{
		int type;
		scanf("%d",&type);
		if(type==1)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			merge(b,a);
		}
		if(type==2)
		{
			int a;
			scanf("%d",&a);
			if(a==fa[a])
				printf("%d\n",val[a]);
			else
				find(a),printf("%d\n",val[a]);
		}
	}
return 0;
}