#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=500000+10;
int fa[maxn];
int v[maxn];
int d[maxn];
int top[maxn];
inline int find(int x){
	if(x==fa[x])
		return x;
	else {
		int u=fa[x];
		int p=find(u);
		if(p!=u){
			v[x]=v[u]^v[x];
			v[x]^=d[u];
			fa[x]=p;
		}
		return fa[x];
	}
}
int main(){
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d",&d[i]);
	for(int i=1;i<=n;i++)
		v[i]=d[i];
	for(int i=1;i<=n;i++)
		fa[i]=i;
	int opt,x,y;
	for(int i=1;i<=m;i++){
		scanf("%d",&opt);
		if(opt==1){
			scanf("%d %d",&x,&y);
			int fy=find(y);
			v[x]=d[x]^v[y];
			fa[x]=fy;
		}
		else {
			scanf("%d",&x);
			find(x);
			printf("%d\n",v[x]);
		}
	}
return 0;
}