#include <bits/stdc++.h>
using namespace std;

const int N=3e5+5;

int l[N], r[N], op[N], pos[N], L[N], R[N], a[N], b[N], c[N], d[N], n, q;
int yuanl[N], yuanr[N];
long long ans[N];

void work()
{
	memcpy(yuanl,l,sizeof(l));
	memcpy(yuanr,r,sizeof(r));
	for(int i=1;i<n;i++)
		l[i] -= i, r[i] -= i;

	for(int i=1;i<=q;i++)
	{
		if(op[i]==1)
			l[pos[i]]=L[i]-pos[i], r[pos[i]]=R[i]-pos[i];
		else if(op[i]==2 && a[i]<c[i])
		{
			int st=b[i]-a[i], ed=d[i]-c[i];
			for(int j=a[i];j<c[i];j++)
			{
				if(l[j]>st)
					st=l[j];
				else if(r[j]<st)
					ans[i] += st-r[j], st=r[j];
			}

			if(st>ed)
				ans[i] += st-ed;
		}
	}

	memcpy(l,yuanl,sizeof(yuanl));
	memcpy(r,yuanr,sizeof(yuanr));
}

int main()
{
	cin >> n >> q;
	for(int i=1;i<n;i++)
	{
		scanf("%d %d",&l[i],&r[i]);
		r[i]--;
	}

	for(int i=1;i<=q;i++)
	{
		scanf("%d",&op[i]);
		if(op[i]==1)
		{
			scanf("%d %d %d",&pos[i],&L[i],&R[i]);
			R[i]--;
		}
		else
		{
			scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
			if(a[i]==c[i])
				ans[i]=max(0,b[i]-d[i]);
		}
	}

	work();

	reverse(l+1,l+n);
	reverse(r+1,r+n);
	for(int i=1;i<=q;i++)
		if(op[i]==1)
			pos[i]=n-pos[i];
		else
		{
			a[i]=n-a[i]+1;
			c[i]=n-c[i]+1;
		}

	work();

	for(int i=1;i<=q;i++)
		if(op[i]==2)
			printf("%lld\n",ans[i]);		
	return 0;
}