#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef __int128 int128;
typedef __uint128_t uint128;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=1.5e5+100;
int ch[Max][2],val[Max],sum[Max],fa[Max];
bool tag[Max];
#define ls(p) ch[p][0]
#define rs(p) ch[p][1]
inline bool get(const int &p)
{
	return rs(fa[p])==p;
}
inline bool is_root(const int &p)
{
	return ls(fa[p])!=p&&rs(fa[p])!=p;
}
inline void push_up(int p)
{
	sum[p]=val[p]^sum[ls(p)]^sum[rs(p)];
}
inline void set_tag(int p)
{
	swap(ls(p),rs(p));
	tag[p]^=1;
}
inline void push_down(int p)
{
	if(tag[p])
	{
		if(ls(p))
			set_tag(ls(p));
		if(rs(p))
			set_tag(rs(p));
		tag[p]=false;
	}
}
inline void rotate(const int x)
{
	const int y=fa[x],z=fa[y];
	const bool k=get(x);
	if(!is_root(y))
		ch[z][get(y)]=x;
	ch[y][k]=ch[x][!k];
	if(ch[x][!k])
		fa[ch[x][!k]]=y;
	ch[x][!k]=y,fa[y]=x,fa[x]=z;
	push_up(y),push_up(x);
}
inline void splay(const int &p)
{
	static int stk[Max];
	int x=p,top=0;
	for(;!is_root(x);x=fa[x])
		stk[++top]=x;
	push_down(x);
	for(;top;--top)
		push_down(stk[top]);
	for(int f;f=fa[p],!is_root(p);rotate(p))
		if(!is_root(f))
			rotate(get(p)==get(f)?f:p);
}
inline int access(int x)
{
	int p=0;
	for(;x;p=x,x=fa[x])
		splay(x),rs(x)=p,push_up(x);
	return p;
}
inline void make_root(const int &p)
{
	access(p),splay(p);
	set_tag(p);
}
inline int find_root(int p)
{
	access(p),splay(p),push_down(p);
	while(ls(p))
		p=ls(p),push_down(p);
	splay(p);
	return p;
}
inline void split(const int &x,const int &y)
{
	make_root(x),access(y),splay(y);
}
inline void link(const int &x,const int &y)
{
	make_root(x);
	if(find_root(y)!=x)
		fa[x]=y;
}
inline void cut(int x,int y)
{
	split(x,y);
	if(ls(y)==x)
		fa[x]=0,ls(y)=0,push_up(y);
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	int n,m,opt,x,y;
	cin>>n>>m;
	for(int i=1;i<=n;++i)
		cin>>val[i],push_up(i);
	while(m--)
	{
		cin>>opt>>x>>y;
		if(opt==0)
		{
			make_root(x);
			if(find_root(y)!=x)
				cout<<"-1\n";
			else
				split(x,y),cout<<sum[y]<<"\n";
		}
		if(opt==1)
			link(x,y);
		if(opt==2)
			cut(x,y);
		if(opt==3)
		{
			make_root(x);
			val[x]=y,push_up(x);
		}
	}
	return 0;
}