#include<stdio.h>
#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;
}
char Buf[1<<23],*P1=Buf,*P2=Buf;
#define getchar() (P1==P2&&(P2=(P1=Buf)+fread(Buf,1,1<<23,stdin),P1==P2)?EOF:*P1++)
template<typename type>
inline void read(type &x)
{
	x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')
		ch=getchar();
	while(ch>='0'&&ch<='9')
		x=x*10+(ch^48),ch=getchar();
}
template<typename type,typename... args>
inline void read(type &x,args&... y)
{
	read(x),read(y...);
}
constexpr int Max=1e6+10;
int cluster_size;
vector<int>e[Max],rt;
int fa[Max],down[Max],depth[Max];
int n,m;
namespace top_cluster
{
	int tmp[Max],num[Max];
	void build(int u,int from)
	{
		depth[u]=depth[from]+1;
		tmp[u]=1;
		int cnt=0;
		for(auto v:e[u])
		{
			build(v,u);
			tmp[u]+=tmp[v];
			if(num[v])
				num[u]=num[v],++cnt;
		}
		if(tmp[u]>=cluster_size||cnt>1||!from)
			tmp[u]=0,num[u]=u,rt.push_back(u);
	}
}
vector<tuple<int,int,int>>ans;
struct node
{
	int x,d,id;
	inline node(const int &x,const int &d,const int &id)
	{
		this->x=x,this->d=d,this->id=id;
	}
	inline bool operator <(const node &a)const
	{
		return depth[x]+d<depth[a.x]+a.d;
	}
};
vector<tuple<int,int,int>>q[Max];
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	read(n,m),cluster_size=sqrt(n)+1;
	for(int i=2;i<=n;++i)
		read(fa[i]),e[fa[i]].push_back(i);
	top_cluster::build(1,0);
	reverse(all(rt));
	for(auto i:rt)
		for(int j=i;j&&!down[j];j=fa[j])
			down[j]=i;
	for(int i=1,u,d;i<=m;++i)
	{
		read(u,d);
		if(!d)
			ans.emplace_back(3,i,0);
		else
			if(!down[u])
			{
				ans.emplace_back(1,u,d);
				ans.emplace_back(3,i,0);
				ans.emplace_back(2,0,0);
			}
			else
			{
				assert(down[u]);
				q[down[u]].emplace_back(u,d,i);
			}
	}
	for(int u=1;u<=n;++u)
	{
		if(q[u].empty())
			continue;
		sort(all(q[u]));
		for(auto [x,d,id]:q[u])
		{
			ans.emplace_back(1,u,max(depth[x]+d-depth[u],0));
			ans.emplace_back(1,x,d);
			ans.emplace_back(3,id,0);
			ans.emplace_back(2,0,0);
		}
		for(int i=0;i<(int)q[u].size();++i)
			ans.emplace_back(2,0,0);
	}
	cout<<ans.size()<<"\n";
	int cnt=0;
	for(auto [o,x,y]:ans)
	{
		if(o==1)
			cout<<o<<" "<<x<<" "<<y<<"\n",++cnt;
		if(o==2)
		{
			assert(cnt);
			cout<<o<<"\n";
			--cnt;
		}
		if(o==3)
			cout<<o<<" "<<x<<"\n";
	}
	assert(!cnt);
	return 0;
}