#include<iostream>

#include<cstring>

#include<cstdlib>

#include<cstdio>

#define ll long long

using namespace std;

const int maxn=,mod=1e9+;

struct poi{int too,pre;}e[maxn];

struct zs{ll sum,delta;}tree[maxn];

int n,m,x,y,z,tot,cnt;

int last[maxn],a[maxn],l[maxn],r[maxn],w[maxn];

char s[maxn];

void read(int &k)

{

    int f=;k=;char c=getchar();

    while(c<''||c>'')c=='-'&&(f=-),c=getchar();

    while(c<=''&&c>='')k=k*+c-'',c=getchar();

    k*=f;

}

void add(int x,int y){e[++tot].too=y;e[tot].pre=last[x];last[x]=tot;}

inline void dfs(int x,int fa)

{

    a[++cnt]=w[x];l[x]=cnt;

    for(int i=last[x];i;i=e[i].pre)

    if(e[i].too!=fa)dfs(e[i].too,x);

    r[x]=cnt;

}

inline void pushup(int x){tree[x].sum=tree[x<<].sum+tree[x<<|].sum;}

inline void pushdown(int x,int l,int r)

{

    if(!tree[x].delta)return;

    tree[x<<].delta+=tree[x].delta;

    tree[x<<|].delta+=tree[x].delta;

    int mid=(l+r)>>;

    tree[x<<].sum+=tree[x].delta*(mid-l+);

    tree[x<<|].sum+=tree[x].delta*(r-mid);

    tree[x].delta=;

}

inline void build(int x,int l,int r)

{

    if(l==r){tree[x].sum=a[l];return;}

    int mid=(l+r)>>;

    build(x<<,l,mid);build(x<<|,mid+,r);

    pushup(x);

}

inline void insert(int x,int l,int r,int cx,int sd,int delta)

{

    if(l==r){if(tree[x].sum<sd)tree[x].sum+=delta;return;}

    pushdown(x,l,r);

    int mid=(l+r)>>;

    if(cx<=mid)insert(x<<,l,mid,cx,sd,delta);

    else insert(x<<|,mid+,r,cx,sd,delta);

    pushup(x);

}

inline void add(int x,int l,int r,int cl,int cr,int delta)

{

    if(cl<=l&&r<=cr){tree[x].delta+=delta,tree[x].sum+=1ll*delta*(r-l+);return;}

    pushdown(x,l,r);

    int mid=(l+r)>>;

    if(cl<=mid)add(x<<,l,mid,cl,cr,delta);

    if(cr>mid)add(x<<|,mid+,r,cl,cr,delta);

    pushup(x);

}

inline ll query(int x,int l,int r,int cl,int cr)

{

    if(cl<=l&&r<=cr)return tree[x].sum;

    pushdown(x,l,r);

    int mid=(l+r)>>;ll res=;

    if(cl<=mid)res+=query(x<<,l,mid,cl,cr);

    if(cr>mid)res+=query(x<<|,mid+,r,cl,cr);

    return res;

}

int main()

{

    read(n);read(m);

    for(int i=;i<=n;i++)

    {

        read(x);read(w[i]);

        x++;add(x,i);

    }

    dfs(,);build(,,cnt);

    for(int i=;i<=m;i++)

    {

        scanf("%s",s+);read(x);read(y);read(z);x++;

        if(s[]=='S')insert(,,cnt,l[x],y,z);

        else if(query(,,cnt,l[x],r[x])<1ll*y*(r[x]-l[x]+))add(,,cnt,l[x],r[x],z);

    }

    for(int i=;i<=n;i++)printf("%lld\n",query(,,cnt,l[i],l[i]));

}