#include<iostream>

#include<cstring>

#include<cstdlib>

#include<cstdio>

#include<algorithm>

#define ll long long

using namespace std;

const int maxn=, inf=1e9;

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

struct tjm{ll deltat, deltav, deltatv;}tree[maxn<<];

int n, m, tott, tot, ty, x, y, z;

int fa[maxn], d[maxn], size[maxn], top[maxn], w[maxn], last[maxn], son[maxn];

char buf[], *ptr=buf-;

inline void read(int &k)

{

    int f=; k=; char c=*++ptr;

    while(c<'' || c>'') c=='-'&&(f=-), c=*++ptr;

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

    k*=f;

}

inline void add(int x, int y){e[++tot]=(poi){y, last[x]}; last[x]=tot;}

void dfs1(int x)

{

    size[x]=;

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

    {

        d[too=e[i].too]=d[x]+;

        dfs1(too);

        size[x]+=size[too];

        if(size[too]>size[son[x]]) son[x]=too;

    }

}

void dfs2(int x, int tp)

{

    top[x]=tp; w[x]=++tott;

    if(son[x]) dfs2(son[x], tp);

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

    if((too=e[i].too)!=son[x]) dfs2(too, too);

}

inline void addone(int x, ll deltat, ll deltav, ll deltatv)

{

    tree[x].deltatv+=deltatv+deltav*tree[x].deltat;

    tree[x].deltat+=deltat;

    tree[x].deltav+=deltav;

}

inline void down(int x)

{

    addone(x<<, tree[x].deltat, tree[x].deltav, tree[x].deltatv);

    addone(x<<|, tree[x].deltat, tree[x].deltav, tree[x].deltatv);

    tree[x].deltat=tree[x].deltav=tree[x].deltatv=;

}

void update(int x, int l, int r, int cl, int cr, int delta, int ty)

{

    if(cl<=l && r<=cr)

    {

        if(ty) tree[x].deltat+=delta;

        else tree[x].deltatv+=tree[x].deltat*delta, tree[x].deltav+=delta;

        return;

    }

    down(x);

    int mid=(l+r)>>;

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

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

}

ll query(int x, int l, int r, int cx)

{

    if(l==r) return tree[x].deltat*tree[x].deltav-tree[x].deltatv;

    down(x);

    int mid=(l+r)>>;

    if(cx<=mid) return query(x<<, l, mid, cx);

    else return query(x<<|, mid+, r, cx);

}

inline void solve(int x, int y, int delta, int ty)

{

    int f1=top[x], f2=top[y];

    while(f1!=f2)

    {

        if(d[f1]<d[f2]) swap(x, y), swap(f1, f2);

        update(, , n, w[f1], w[x], delta, ty);

        x=fa[f1]; f1=top[x];

    }

    if(d[x]<d[y]) swap(x, y);

    update(, , n, w[y], w[x], delta, ty);

}

int main()

{

    fread(buf, , sizeof(buf), stdin); read(n);

    for(int i=;i<=n;i++) read(fa[i]), add(fa[i], i);

    dfs1(); dfs2(, ); read(m);

    for(int i=;i<=m;i++) read(ty), read(x), read(y), solve(, x, y, ty-);

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

}