#include <bits/stdc++.h>
using namespace std;
#define clo 1000.*clock()/CLOCKS_PER_SEC
#ifndef xxzx
#define endl '\n'
#endif
using ll=long long;
using PII=pair<int,int>;
const int N=4e5+10;
bool memory1;
template<typename T=int> T read() {
    T f=1,x=0; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=x*10+ch-'0', ch=getchar(); }
    return f*x;
}
int n,m,l[N],r[N],ls[N],rs[N],id[N],idfn[N];
unsigned va[N],vb[N],len[N];
struct SegmentTree {
    unsigned res[N<<2],lz[N<<2],f[N<<2],cl[N<<2];
    #define ls (id<<1)
    #define rs (id<<1|1)
    // res = v*f
    void Build(int id,int l,int r) {
        if(l==r) return f[id]=vb[idfn[l]],void();
        int mid=(l+r)>>1;
        Build(ls,l,mid),Build(rs,mid+1,r);
        f[id]=f[ls]+f[rs];
    }
    void pushdown(int id) {
        if(cl[id]) {
            cl[id]=0;
            res[ls]=lz[ls]=0,cl[ls]=1;
            res[rs]=lz[rs]=0,cl[rs]=1;
        }
        if(lz[id]) {
            unsigned val=lz[id]; lz[id]=0;
            res[ls]+=f[ls]*val,lz[ls]+=val;
            res[rs]+=f[rs]*val,lz[rs]+=val;
        }
    }
    void Modify(int id,int l,int r,int x,int y,unsigned val) {
        if(x>y) return;
        if(x<=l&&y>=r) {
            // cerr<<"Modi "<<id<<" "<<l<<" "<<r<<" "<<x<<" "<<y<<" "<<f[id]*val<<" "<<f[id]<<endl;
            res[id]+=f[id]*val,lz[id]+=val;
            return;
        }
        pushdown(id);
        int mid=(l+r)>>1;
        if(x<=mid) Modify(ls,l,mid,x,y,val);
        if(y>mid) Modify(rs,mid+1,r,x,y,val);
        res[id]=res[ls]+res[rs];
    }
    void Clear(int id,int l,int r,int x,int y) {
        if(x>y) return;
        if(x<=l&&y>=r) {
            res[id]=lz[id]=0,cl[id]=1;
            return;
        }
        pushdown(id);
        int mid=(l+r)>>1;
        if(x<=mid) Clear(ls,l,mid,x,y);
        if(y>mid) Clear(rs,mid+1,r,x,y);
        res[id]=res[ls]+res[rs];
    }
    #undef ls
    #undef rs
}sgt;
int sz[N],son[N],fa[N][20],dep[N];
void dfs1(int x,unsigned sum) {
    // cerr<<"Dfs1"<<endl;
    sum+=va[x];
    vb[x]+=sum*len[x],sz[x]=1;
    if(!ls[x]) return;
    for(auto y:{ls[x],rs[x]}) {
        fa[y][0]=x,dep[y]=dep[x]+1;
        dfs1(y,sum);
        sz[x]+=y;
    }
    son[x]=(sz[ls[x]]>=sz[rs[x]])? ls[x]:rs[x];
}
void dfs11(int x) {
    if(!ls[x]) return;
    for(auto y:{ls[x],rs[x]}) {
        vb[x]-=vb[y];
        dfs11(y);
    }
}
int jump(int x,int h) {
    for(int i=0;h;h>>=1,i++) if(h&1) x=fa[x][i];
    return x;
}
int lca(int x,int y) {
    if(dep[x]<dep[y]) swap(x,y);
    x=jump(x,dep[x]-dep[y]);
    if(x==y) return x;
    for(int i=19;i>=0;i--)
        if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
    return fa[x][0];
}
int L[3][N],R[3][N],tim,top[N],vis[N];
void dfs2(int x) {
    // cerr<<"Dfs2 "<<endl;
    vector<int> nd;
    int p=x; vis[p]=1,nd.push_back(p);
    while(son[p]) p=son[p],vis[p]=1,nd.push_back(p);
    for(auto i:nd) L[0][i]=++tim,top[i]=x,idfn[tim]=i;
    for(auto i:nd) R[0][i]=tim;
    for(auto i:nd) {
        L[1][i]=tim+1;
        if(ls[i]&&!vis[ls[i]]) dfs2(ls[i]);
        R[1][i]=tim;
    }
    for(auto i:nd) {
        L[2][i]=tim+1;
        if(rs[i]&&!vis[rs[i]]) dfs2(rs[i]);
        R[2][i]=tim;
    }
}
int rt;
void clear(int x) {  // x 到根全体清空
    while(x) {
        sgt.Clear(1,1,2*n-1,L[0][top[x]],L[0][x]);
        x=fa[top[x]][0];
    }
}
void addsub(int p,unsigned v) {
    // cerr<<"Sub "<<p<<endl;
    // cerr<<L[0][p]<<" "<<R[0][p]<<endl;
    // cerr<<L[1][p]<<" "<<R[1][idfn[R[0][p]]]<<endl;
    // cerr<<L[2][p]<<" "<<R[2][idfn[R[0][p]]]<<endl;
    sgt.Modify(1,1,2*n-1,L[0][p],R[0][p],v);
    sgt.Modify(1,1,2*n-1,L[1][p],R[1][idfn[R[0][p]]],v);
    sgt.Modify(1,1,2*n-1,L[2][p],R[2][idfn[R[0][p]]],v);
}
void add(int x,int y,int op,unsigned v) { // x 到 y 左/右 子树加
    // cerr<<"Add "<<x<<" "<<y<<" "<<op<<" "<<v<<endl;
    int nx=-1;
    while(top[x]!=top[y]) {
        // cerr<<x<<" "<<top[x]<<endl;
        if(((op==1)? ls[x]:rs[x])!=nx||x!=top[x]) {
            if(((op==1)? ls[x]:rs[x])==nx) x=fa[x][0];
            sgt.Modify(1,1,2*n-1,L[op][top[x]],R[op][x],v);
        }
        if(son[x]&&((op==1)? ls[x]:rs[x])==son[x]) addsub(son[x],v);
        nx=top[x],x=fa[top[x]][0];
    }
    // cerr<<"H "<<x<<" "<<y<<endl;
    if(((op==1)? ls[x]:rs[x])!=nx||x!=y) {
        if(((op==1)? ls[x]:rs[x])==nx) x=fa[x][0];
        sgt.Modify(1,1,2*n-1,L[op][y],R[op][x],v);
    }
    if(son[x]&&((op==1)? ls[x]:rs[x])==son[x]) addsub(son[x],v);
}
bool memory2;
int main() {

    n=read(),m=read();
    set<pair<PII,int>> seg;
    for(int i=1;i<=2*n-1;i++) {
        l[i]=read(),r[i]=read(),va[i]=read<unsigned>(),vb[i]=read<unsigned>();
        seg.insert({{l[i],r[i]},i});
        len[i]=r[i]-l[i]+1;
        if(l[i]!=r[i]) ls[i]=read(),rs[i]=read();
        if(l[i]==1&&r[i]==n) rt=i;
    }
    dfs1(rt,0);
    dfs11(rt);
    dfs2(rt);
    for(int j=1;j<20;j++) for(int i=1;i<=2*n-1;i++) fa[i][j]=fa[fa[i][j-1]][j-1];
    for(int i=1;i<=2*n-1;i++) if(rs[i]) id[l[rs[i]]]=i;
    id[1]=2*n,id[n+1]=2*n+1,dep[2*n]=dep[2*n+1]=-1;
    // for(int i=1;i<=2*n-1;i++) cerr<<idfn[i]<<" ";
    // cerr<<endl;
    // for(int i=1;i<=2*n-1;i++) cerr<<son[i]<<" ";
    // cerr<<endl;
    sgt.Build(1,1,2*n-1);
    // unsigned val=(vb[3]+vb[4]+vb[5]+vb[7]);
    // cerr<<val<<endl;
    // m=1;
    // return 0;
    for(int _=1,l,r,v;_<=m;_++) {
        l=read(),r=read(),v=read();
        auto it=seg.lower_bound({{l,r},0});
        if(it!=seg.end()&&it->first==make_pair(l,r)) {
            int p=it->second;
            clear(fa[p][0]);
            // cerr<<"P "<<p<<endl;
            addsub(p,v);
        }
        else {
            int x=id[l],y=id[r+1],z=((max(x,y)<=2*n-1)? lca(x,y):max(x,y));
            // cerr<<"A "<<x<<" "<<y<<" "<<2*n-1<<endl;
            if(x<=2*n-1&&x!=z) { clear(x),add(x,jump(x,dep[x]-dep[z]-1),2,v); }
            if(y<=2*n-1&&y!=z) { clear(y),add(y,jump(y,dep[y]-dep[z]-1),1,v); }
        }
        cout<<sgt.res[1]<<endl;
    }

    #ifdef xxzx
    cerr<<"Time: "<<clo<<"MS"<<endl;
    cerr<<"Memory: "<<abs(&memory1-&memory2)/1024./1024.<<"MB"<<endl;
    #endif
    return 0;
}