#include<bits/stdc++.h>
#define LL int
#define SZ(x) ((LL)(x.size()))
#define all(x) (x).begin(),(x).end()
using namespace std;
inline LL read(){
  LL q=0,w=1;char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
#define ll long long
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
inline void writeln(LL x){write(x);puts("");}
inline void writecs(LL x){write(x);putchar(' ');}

inline void dmin(LL &x,LL y){if(x>y)x=y;return ;}
inline void dmax(LL &x,LL y){if(x<y)x=y;return ;}

#define cout cerr
#define pb push_back

const LL N = 100000+95 , M = 450 ;
LL n,m,fa[N];vector<LL>E[N];

struct atom{LL l,r,d;};atom dat[N][M];

LL dep[N],rep[N],ext[M],tag[N<<1][M];vector<LL>vc[N];

int main(){
  n=read();m=read();dep[1]=1;vc[dep[1]].pb(1);LL mx=1;
  for(LL t=2;t<=n;t++){fa[t]=read();E[fa[t]].pb(t);dep[t]=dep[fa[t]]+1;dmax(mx,dep[t]);vc[dep[t]].pb(t);}
  vector<LL>vec;vec.pb(0);for(LL t=1;t<=mx;t++)vec.pb(SZ(vc[t]));
  sort(all(vec));vec.erase(unique(all(vec)),vec.end());LL lim=SZ(vec)-1;

  for(LL t=1;t<=n;t++){
    LL l=1,r=lim,pos=-1;
    while(l<=r){
      LL mid=(l+r)>>1;
      if(vec[mid]<=SZ(vc[dep[t]])){l=mid+1;pos=mid;}
      else {r=mid-1;}
    }
    assert(pos!=-1&&vec[pos]==SZ(vc[dep[t]]));rep[t]=pos;dmax(ext[rep[t]],dep[t]);
  }
  for(LL t=1;t<=n;t++)
    for(LL i=1;i<=lim;i++)dat[t][i]=(atom){n+1,0,n+1};
  for(LL x=n;x>=1;x--){
    dat[x][rep[x]]=(atom){x,x,dep[x]};
    for(auto y:E[x])
      for(LL i=rep[x]+1;i<=lim;i++){
	dmin(dat[x][i].l,dat[y][i].l);
	dmax(dat[x][i].r,dat[y][i].r);
	dmin(dat[x][i].d,dat[y][i].d);
      }
  }

  LL dt=0,TC=m;
  while(TC--){
    LL opt=read();
    if(opt==1){
      LL x=read(),y=read();
      for(LL i=rep[x];i<=lim;i++){
	LL B=vec[i];LL k=ext[i]-dat[x][i].d+1;
	LL l=dat[x][i].l,r=dat[x][i].r;
	tag[(m-dt)+l][i]+=y;
	if((m-dt)+r+1<=m+n)tag[(m-dt)+r+1][i]-=y;
	if((m-dt)+l+k*B<=m+n)tag[(m-dt)+l+k*B][i]-=y;
	if((m-dt)+r+1+k*B<=m+n)tag[(m-dt)+r+1+k*B][i]+=y;
      }
    }
    else {dt++;}
  }

  for(LL x=1;x<=m+n;x++)
    for(LL i=1;i<=lim;i++)tag[x][i]+=tag[x-1][i];
  for(LL x=1;x<=m+n;x++)
    for(LL i=1;i<=lim;i++)if(x+vec[i]<=m+n)tag[x+vec[i]][i]+=tag[x][i];

  LL ans=0;
  for(LL i=1;i<=n;i++){
    LL x=m+i;ll u=0ll;
    while(x>=1){
      for(LL j=1;j<=lim;j++)u+=tag[x][j];
      x-=n;
    }
    ans^=u;
  }
  writeln(ans);
  
  return 0;
}