#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 400000
using namespace std;
unsigned int read()
{
	char c=0;
	unsigned int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct points
{
	int x,y;
	unsigned int data;
	bool operator < (const points &t)const
	{
		return x<t.x;
	}
};
int n,m,rt,sl[N+1],sr[N+1],ls[N+1],rs[N+1],fa[N+1];
unsigned int a[N+1],b[N+1],va[N+1],vb[N+1],delta[N+1],res;
void dfs(int x)
{
	vb[x]+=va[x]*(sr[x]-sl[x]+1);
	if (ls[x]) va[ls[x]]+=va[x],va[rs[x]]+=va[x],dfs(ls[x]),dfs(rs[x]);
	return;
}
bool cmp(points a,points b)
{
	return a.y<b.y;
}
struct KDT
{
	struct node
	{
		int x1,x2,y1,y2,ls,rs;
		unsigned int data,res,lazy2;
		bool lazy;
	};
	node tree[(N<<2)+1];
	int length;
	void push_up(int k)
	{
		tree[k].res=tree[tree[k].ls].res+tree[tree[k].rs].res;
		return;
	}
	void push_tag(int k)
	{
		tree[k].res=tree[k].lazy2=0,tree[k].lazy=1;
		return;
	}
	void push_tag2(int k,unsigned int d)
	{
		tree[k].res+=tree[k].data*d,tree[k].lazy2+=d;
		return;
	}
	void spread(int k)
    {
		if (tree[k].lazy) push_tag(tree[k].ls),push_tag(tree[k].rs),tree[k].lazy=0;
		if (tree[k].lazy2) push_tag2(tree[k].ls,tree[k].lazy2),push_tag2(tree[k].rs,tree[k].lazy2),tree[k].lazy2=0;
		return;
	}
	int build(vector<points>p)
	{
	    int nw=++length;
		vector<points>A;
		vector<points>B;
		tree[nw].x1=tree[nw].x2=p[0].x,tree[nw].y1=tree[nw].y2=p[0].y,tree[nw].data=p[0].data;
		for (int i=1;i<p.size();++i) tree[nw].x1=min(tree[nw].x1,p[i].x),tree[nw].x2=max(tree[nw].x2,p[i].x),tree[nw].y1=min(tree[nw].y1,p[i].y),tree[nw].y2=max(tree[nw].y2,p[i].y),tree[nw].data+=p[i].data;
		if (p.size()==1) return nw;
		if (tree[nw].x2-tree[nw].x1>=tree[nw].y2-tree[nw].y1) nth_element(p.begin(),p.begin()+(p.size()>>1),p.end());
		else nth_element(p.begin(),p.begin()+(p.size()>>1),p.end(),cmp);
		for (int i=0;i<(p.size()>>1);++i) A.push_back(p[i]);
		for (int i=(p.size()>>1);i<p.size();++i) B.push_back(p[i]);
		tree[nw].ls=build(A),tree[nw].rs=build(B);
		return nw;
	}
	void add(int k,int l1,int r1,int l2,int r2,unsigned int d)
	{
		if (max(tree[k].x1,l1)>min(tree[k].x2,r1)||max(tree[k].y1,l2)>min(tree[k].y2,r2)) return;
		if (l1<=tree[k].x1&&tree[k].x2<=r1&&l2<=tree[k].y1&&tree[k].y2<=r2)
		{
			push_tag2(k,d);
			return;
		}
		spread(k),add(tree[k].ls,l1,r1,l2,r2,d),add(tree[k].rs,l1,r1,l2,r2,d),push_up(k);
		return;
	}
	void clear(int k,int l1,int r1,int l2,int r2)
	{
		if (max(tree[k].x1,l1)>min(tree[k].x2,r1)||max(tree[k].y1,l2)>min(tree[k].y2,r2)) return;
		if (l1<=tree[k].x1&&tree[k].x2<=r1&&l2<=tree[k].y1&&tree[k].y2<=r2)
		{
			push_tag(k);
			return;
		}
		spread(k),clear(tree[k].ls,l1,r1,l2,r2),clear(tree[k].rs,l1,r1,l2,r2),push_up(k);
		return;
	}
};
KDT T;
int main()
{
	vector<points>p;
	int l,r,d;
	n=read(),m=read();
	for (int i=1;i<=(n<<1)-1;++i)
	{
		sl[i]=read(),sr[i]=read(),va[i]=read(),vb[i]=read();
		if (sl[i]!=sr[i]) ls[i]=read(),rs[i]=read(),fa[ls[i]]=fa[rs[i]]=i;
		if (sl[i]==1&&sr[i]==n) rt=i;
	}
	dfs(rt);
	for (int i=1;i<=(n<<1)-1;++i)
	{
		if (fa[i]) delta[fa[i]]-=vb[i];
		delta[i]+=vb[i];
	}
	for (int i=1;i<=(n<<1)-1;++i) p.push_back((points){sl[i],sr[i],delta[i]});
	rt=T.build(p);
	while (m--) l=read(),r=read(),d=read(),T.clear(rt,1,l-1,l,n),T.clear(rt,1,r,r+1,n),T.add(rt,l,r,l,r,d),printf("%u\n",T.tree[rt].res);
	return 0;
}