/*
	Luogu name: Symbolize
	Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=3e5+10;
const int inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int n,q,ans[N];
pii p[N];
struct Query
{
	int opt;
	int a,b,c,d;
}Q[N];
struct Segment_tree
{
	int pl[N],pr[N];
	struct node
	{
		int l,r;
		bool res;
		int x,y;
		int z;
		pii get(int st) const
		{
			if(!res) 
			{
				if(st<x) return make_pair(x,0);
				if(st>y) return make_pair(y,st-y);
				return make_pair(st,0);
			}
			return make_pair(y,max(0ll,st-x)+z);
		}
		friend node operator+(const node &a,const node &b)  
		{
			node ans;
			if(!a.res&&!b.res)
			{
				if(a.x>b.y) ans={a.l,b.r,1,a.x,b.y,a.x-b.y};
				else if(a.y<b.x) ans={a.l,b.r,1,a.y,b.x,0};
				else ans={a.l,b.r,0,max(a.x,b.x),min(a.y,b.y),0};
			}
			else if(!a.res&&b.res)
			{
				if(b.x<a.x) ans={a.l,b.r,1,a.x,b.y,(a.x-b.x)+b.z};
				else if(b.x>a.y) ans={a.l,b.r,1,a.y,b.y,b.z};
				else ans={a.l,b.r,1,b.x,b.y,b.z};
			}
			else
			{
				pii now=b.get(a.y);
				ans={a.l,b.r,1,a.x,now.x,now.y+a.z};
			}
			return ans;
		}
	}tr[N<<2];
	int ls(int p){return p<<1;}
	int rs(int p){return p<<1|1;}
	void push_up(int p){tr[p]=tr[ls(p)]+tr[rs(p)];};
	void build(int p,int l,int r)
	{
		tr[p]={l,r,0,0,0,0};
		if(l==r)
		{
			tr[p].res=0;
			tr[p].x=pl[l];
			tr[p].y=pr[l];
			return;
		}
		int mid=l+r>>1;
		build(ls(p),l,mid);
		build(rs(p),mid+1,r);
		push_up(p);
		return;
	}
	void update(int p,int x)
	{
		if(tr[p].l==tr[p].r)
		{
			tr[p].x=pl[x];
			tr[p].y=pr[x];
			return;
		}
		int mid=tr[p].l+tr[p].r>>1;
		if(x<=mid) update(ls(p),x);
		else update(rs(p),x);
		push_up(p);
		return;
	}
	node query(int p,int l,int r)
	{
		if(tr[p].l>=l&&tr[p].r<=r) return tr[p];
		int mid=tr[p].l+tr[p].r>>1;
		if(r<=mid) return query(ls(p),l,r);
		if(l>mid) return query(rs(p),l,r);
		return query(ls(p),l,r)+query(rs(p),l,r);
	}
}seg;
int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
void solve()
{
	seg.build(1,1,n-1); 
	rep1(i,1,q)
	{
		if(Q[i].opt==1)
		{
			int x=Q[i].a;
			seg.pl[x]=Q[i].b+n-x;
			seg.pr[x]=Q[i].c+n-x;
			seg.update(1,x);
		}
		if(Q[i].opt==2)
		{
			if(Q[i].a>Q[i].c) continue;
			if(Q[i].a==Q[i].c) 
			{
				ans[i]=max(0ll,Q[i].b-Q[i].d);
				continue;
			}
			Q[i].b+=n-Q[i].a;
			Q[i].d+=n-Q[i].c;
			pii now=seg.query(1,Q[i].a,Q[i].c-1).get(Q[i].b);
			ans[i]=now.y+max(0ll,now.x-Q[i].d);
		}
	}
	return;
}
signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	q=read();
	rep1(i,1,n-1)
	{
		p[i].x=read();
		p[i].y=read()-1;
	}
	rep1(i,1,q)
	{
		Q[i].opt=read();
		if(Q[i].opt==1) Q[i].a=read(),Q[i].b=read(),Q[i].c=read()-1;
		if(Q[i].opt==2) Q[i].a=read(),Q[i].b=read(),Q[i].c=read(),Q[i].d=read();
	}
	rep1(i,1,n) seg.pl[i]=p[i].x+n-i,seg.pr[i]=p[i].y+n-i;
	solve();
//	rep1(i,1,q) 
//	{
//		if(Q[i].opt==1) Q[i].a=Q[i].a;
//		if(Q[i].opt==2) Q[i].a=n-Q[i].a+1,Q[i].c=n-Q[i].c+1;
//	}
//	rep1(i,1,n) seg.pl[i]=p[n-i].x+n-i,seg.pr[i]=p[n-i].y+n-i;
//	solve();
	rep1(i,1,q) if(Q[i].opt==2) cout<<ans[i]<<"\n";
	return 0;
}