#include<cstdio>

 #include<iostream>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #define ll long long

 #define ui unsigned int

 #define ull unsigned long long

 const int maxn=,mxnode=maxn<<;

 struct zs{int too,pre;}e[maxn];int tot,last[maxn];

 struct mat{ll mp[][];}tag[mxnode],nul={,,,,,,,,};

 int lc[mxnode],rc[mxnode],tt;

 int dfn[maxn],tim,fa[maxn],bel[maxn],sz[maxn];

 int i,j,k,n,m;

 int L,R;mat TAG;

 ll an[maxn];

 int ra,fh;char rx;

 inline int read(){

     rx=getchar(),ra=,fh=;

     while((rx<''||rx>'')&&rx!='-')rx=getchar();

     if(rx=='-')fh=-,rx=getchar();

     while(rx>=''&&rx<='')ra*=,ra+=rx-,rx=getchar();return ra*fh;

 }

 mat operator *(mat a,mat b){

     mat c;

     int i,j,k;

     for(i=;i<;i++)for(j=;j<;j++)for(k=c.mp[i][j]=;k<;k++)

         c.mp[i][j]+=a.mp[i][k]*b.mp[k][j];

     return c;

 }

 inline void pushdown(int x){

     if(!tag[x].mp[][]&&!tag[x].mp[][])return;

     int l=lc[x],r=rc[x];

     tag[l]=tag[l]*tag[x],tag[r]=tag[r]*tag[x],

     tag[x]=nul;

 }

 void insert(int x,int a,int b){

     if(L<=a&&R>=b){tag[x]=tag[x]*TAG;return;}

     pushdown(x);

     int mid=a+b>>;

     if(L<=mid)insert(lc[x],a,mid);

     if(R>mid)insert(rc[x],mid+,b);

 }

 void dfss(int x,int a,int b){

     if(a==b){an[a]=tag[x].mp[][];return;}

     pushdown(x);

     int mid=a+b>>;

     dfss(lc[x],a,mid),dfss(rc[x],mid+,b);

 }

 void build(int a,int b){

     int x=++tt;tag[x]=nul;

     if(a==b)return;

     int mid=a+b>>;

     lc[x]=tt+,build(a,mid),rc[x]=tt+,build(mid+,b);

 }

 void dfs(int x){

     sz[x]=;

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

         fa[e[i].too]=x,dfs(e[i].too),sz[x]+=sz[e[i].too];

 }

 void dfs2(int x,int chain){

     int i,mx=;

     bel[x]=chain,dfn[x]=++tim;

     for(i=last[x];i;i=e[i].pre)if(sz[e[i].too]>sz[mx])mx=e[i].too;

     if(!mx)return;

     dfs2(mx,chain);

     for(i=last[x];i;i=e[i].pre)if(e[i].too!=mx)dfs2(e[i].too,e[i].too);

 }

 void run(int x){

     while(bel[x]!=bel[])

         L=dfn[bel[x]],R=dfn[x],insert(,,n),

         x=fa[bel[x]];

     L=dfn[bel[]],R=dfn[x],insert(,,n);

 }

 inline void ins(int a,int b){

     e[++tot].too=b,e[tot].pre=last[a],last[a]=tot;

 }

 int main(){

     n=read();

     for(i=;i<=n;i++)ins(read(),i);

     dfs(),dfs2(,);

     build(,n);

     int id,x,d;

     for(m=read();m;m--){

         id=read(),x=read(),d=read();TAG=nul;

         if(id==)TAG.mp[][]=d;else TAG.mp[][]=d;

         run(x);

     }

     dfss(,,n);

     for(i=;i<=n;i++)printf("%lld\n",an[dfn[i]]);

 }