#include<bits/stdc++.h>
using namespace std;
int n,m,a,b,s[300005],fa[300005];
int find(int x){
	if(fa[x] == x) return x;
	return fa[x] = find(fa[x]);
} 
int main(){
	freopen("td.in","r",stdin);
	freopen("td.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i = 1; i <= n; i++){
		fa[i] = i;
		int x;
		cin >> x;
		s[i] = x;
	}
	while(m--){
		int opt;
		scanf("%d",&opt);
		if(opt == 1){
			scanf("%d%d",&a,&b);
			fa[a] = b;
		}else{
			cin >> a;
			int ans = s[a];
			if(fa[a] == a){
				cout << ans << endl;
				continue;
			}else{
				a = fa[a];
				while(fa[a] != a){
					ans^=s[a];
					a = fa[a];
					
				}
			
				ans^=s[a];
			}
			cout << ans << endl;
		}
	}
	return 0;
}