#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e5+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,fa[N],d[N],siz[N],id[N],k;
int L[455][N],R[455][N],f[455][N*2],ans[N];
int op[N],X[N],Y[N];
void add(int x,int y,int len,int is,int w){
	gdb(x,y,len,is,w);
	x-=(len-1)*siz[id[is]];
	y-=(len-1)*siz[id[is]];
	for(int i=x;i<=y;i++){
		f[is][i]+=w;
		if(i+len*siz[id[is]]<=n+m) f[is][i+len*siz[id[is]]]-=w;
	}
}
void Solve(){
	scanf("%d%d",&n,&m);
	d[1]=1;
	for(int i=2;i<=n;i++) scanf("%d",&fa[i]),d[i]=d[fa[i]]+1;
	for(int i=1;i<=n;i++) siz[d[i]]++;
	int maxd=*max_element(d+1,d+n+1);
	for(int i=1;i<=maxd;i++)if(siz[i]^siz[i+1]){
		id[++k]=i;
		Me(L[k],0x3f);Me(R[k],-0x3f);
		for(int j=n;j;j--){
			if(d[j]==i) L[k][j]=R[k][j]=j;
			L[k][fa[j]]=min(L[k][fa[j]],L[k][j]);
			R[k][fa[j]]=max(R[k][fa[j]],R[k][j]);
		}
	}
	int tot=0;
	for(int i=1;i<=m;i++){
		scanf("%d",&op[i]);
		if(op[i]==1) scanf("%d%d",&X[i],&Y[i]);
		else tot++;
	}
	for(int i=1;i<=m;i++){
		if(op[i]==2){tot--;continue;}
		int x=X[i];
		for(int j=1;j<=k;j++)if(L[j][x]<=R[j][x]){
			int v=id[j];
			add(L[j][x]+tot,R[j][x]+tot,d[x]>id[j-1]?v-d[x]+1:v-id[j-1],j,Y[i]);
		}
	}
	for(int i=1;i<=k;i++){
		for(int j=1;j<=n+m;j++){
			if(j>=siz[i]) f[i][j]+=f[i][j-siz[i]];
			ans[(j-1)%n+1]+=f[i][j];
		}
	}
	int res=0;for(int i=1;i<=n;i++) res^=ans[i],gdb(ans[i]);
	printf("%d\n",res);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}