#include<bits/stdc++.h>
using namespace std;
int n,m,rt;
int pos[200005],pmid[200005];
int L[400005],R[400005],ls[400005],rs[400005];
int son[400005],siz[400005],ed[400005];
unsigned va[400005],vb[400005],val[400005];
int fa[400005],dep[400005],top[400005];
int id[400005],idlb[400005],idle[400005],idrb[400005],idre[400005],cnt;
void dfs1(int x){
    val[x]=va[x]*(R[x]-L[x]+1)+vb[x];
    dep[x]=dep[fa[x]]+1;
    if(L[x]<R[x]){
        va[ls[x]]+=va[x];
        va[rs[x]]+=va[x];
        pmid[R[ls[x]]]=x;
        dfs1(ls[x]);
        dfs1(rs[x]);
        if(R[ls[x]]-L[x]>=R[x]-L[rs[x]])son[x]=ls[x];
        else son[x]=rs[x];
        ed[x]=ed[son[x]];
    }else ed[x]=x;
    siz[x]=2*(R[x]-L[x])+1;
}
void dfs11(int x){
    if(L[x]<R[x]){
        val[x]-=val[ls[x]]+val[rs[x]];
        dfs11(ls[x]);
        dfs11(rs[x]);
    }
}
void dfs2(int x){
    for(int i=x;i;i=son[i])id[i]=++cnt,top[i]=x;
    for(int i=x;i;i=son[i]){
        idlb[i]=cnt+1;
        if(son[i]&&son[i]==rs[i])dfs2(ls[i]);
        idle[i]=cnt;
    }
    for(int i=x;i;i=son[i]){
        idrb[i]=cnt+1;
        if(son[i]&&son[i]==ls[i])dfs2(rs[i]);
        idre[i]=cnt;
    }
}
int LCA(int x,int y){
    while(top[x]!=top[y])
        if(dep[top[x]]>=dep[top[y]])x=fa[top[x]];
        else y=fa[top[y]];
    if(dep[x]<=dep[y])return x;
    else return y;
}
unsigned sum[1600005],tree[1600005],tag[1600005];
int tag1[1600005];
void update(int k,int l,int r,int x,unsigned y){
    if(l==r){
        sum[k]=y;
        return;
    }
    int mid=l+r>>1;
    if(x<=mid)update(k*2,l,mid,x,y);
    else update(k*2+1,mid+1,r,x,y);
    sum[k]=sum[k*2]+sum[k*2+1];
}
void pushdown(int k){
    if(tag1[k]){
        tree[k*2]=tree[k*2+1]=0;
        tag[k*2]=tag[k*2+1]=0;
        tag1[k*2]=tag1[k*2+1]=1;
        tag1[k]=0;
    }
    if(tag[k]){
        tree[k*2]+=tag[k]*sum[k*2];
        tree[k*2+1]+=tag[k]*sum[k*2+1];
        tag[k*2]+=tag[k];
        tag[k*2+1]+=tag[k];
        tag[k]=0;
    }
}
void change(int k,int l,int r,int x,int y,unsigned z){
    // if(k==1)printf("change(%d,%d,%u)\n",x,y,z);
    if(x>y)return;
    if(l>=x&&r<=y){
        tree[k]+=z*sum[k];
        tag[k]+=z;
        return;
    }
    pushdown(k);
    int mid=l+r>>1;
    if(x<=mid)change(k*2,l,mid,x,y,z);
    if(y>mid)change(k*2+1,mid+1,r,x,y,z);
    tree[k]=tree[k*2]+tree[k*2+1];
}
void clear(int k,int l,int r,int x,int y){
    if(x>y)return;
    if(l>=x&&r<=y){
        tree[k]=0;
        tag[k]=0;
        tag1[k]=1;
        return;
    }
    pushdown(k);
    int mid=l+r>>1;
    if(x<=mid)clear(k*2,l,mid,x,y);
    if(y>mid)clear(k*2+1,mid+1,r,x,y);
    tree[k]=tree[k*2]+tree[k*2+1];
}
void clear(int x){while(x)clear(1,1,cnt,id[top[x]],id[x]),x=fa[top[x]];}
void updatel(int x,int y,unsigned z){
    while(top[x]!=top[y]){
        change(1,1,cnt,idlb[top[x]],idle[x],z);
        x=top[x];
        if(fa[x]&&x==rs[fa[x]]&&fa[x]!=y){
            int p=ls[fa[x]];
            change(1,1,cnt,id[p],id[ed[p]],z);
            change(1,1,cnt,idlb[p],idle[ed[p]],z);
            change(1,1,cnt,idrb[p],idre[ed[p]],z);
        }
        x=fa[x];
    }
    if(x!=y)change(1,1,cnt,idlb[son[y]],idle[x],z);
}
void updater(int x,int y,unsigned z){
    while(top[x]!=top[y]){
        change(1,1,cnt,idrb[top[x]],idre[x],z);
        x=top[x];
        if(fa[x]&&x==ls[fa[x]]&&fa[x]!=y){
            int p=rs[fa[x]];
            change(1,1,cnt,id[p],id[ed[p]],z);
            change(1,1,cnt,idlb[p],idle[ed[p]],z);
            change(1,1,cnt,idrb[p],idre[ed[p]],z);
        }
        x=fa[x];
    }
    if(x!=y)change(1,1,cnt,idrb[son[y]],idre[x],z);
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<2*n;i++){
        scanf("%d%d%u%u",&L[i],&R[i],&va[i],&vb[i]);
        if(L[i]<R[i]){
            scanf("%d%d",&ls[i],&rs[i]);
            fa[ls[i]]=fa[rs[i]]=i;
        }else pos[L[i]]=i;
        if(L[i]==1&&R[i]==n)rt=i;
    }
    dfs1(rt);
    dfs11(rt);
    dfs2(rt);
    // for(int i=1;i<=cnt;i++)printf("%u ",val[i]);puts("");
    for(int i=1;i<2*n;i++)update(1,1,cnt,id[i],val[i]);
    while(m--){
        int x,y;unsigned z;
        scanf("%d%d%u",&x,&y,&z);
        if(x==1&&y==n){
            change(1,1,n,1,cnt,z);
        }else if(x==1){
            clear(pmid[y]);
            y=pos[y+1];
            updatel(y,0,z);
        }else if(y==n){
            clear(pmid[x-1]);
            x=pos[x-1];
            updater(x,0,z);
        }else{
            clear(pmid[x-1]),clear(pmid[y]);
            x=pos[x-1],y=pos[y+1];
            int lca=LCA(x,y);
            // printf("x=%d y=%d lca=%d\n",x,y,lca);
            updater(x,lca,z);
            // puts("!");
            updatel(y,lca,z);
        }
        printf("%u\n",tree[1]);
    }
    return 0;
}