#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
typedef unsigned long long ull;
const ull mul=131;
typedef long long ll;
il int read(){
    int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-48,c=getchar();
    return x;
}
il void swap(int &x,int &y){int z=x;x=y,y=z;}
il void cmax(int &x,int y){x=x>y?x:y;}
const int N=5e5+5,M=10001;
int T,n,fa[N][20],c[N],a[N],v[N],d[N],lg[N];ll ans[N];unsigned short lcp[M][M];ull h[N][20],pw[N];
int t[N][2],cnt,de[N],p[N];
int sa[N],rk[N],height[N],st[N][20];
vector<pii> e[N];
il void add(int x,int y,int z){e[x].push_back({y,z});}
void dfs(int x,int u){
    int y,z;p[x]=u,d[x]=d[fa[x][0]]+1,h[x][0]=1ull*c[x];
    for(int i=1;(1<<i)<=d[x]-1;++i) fa[x][i]=fa[fa[x][i-1]][i-1],h[x][i]=h[x][i-1]*pw[1<<(i-1)]+h[fa[x][i-1]][i-1];
    for(auto it:e[x]){
        y=it.fi,z=it.se;
        if(!t[u][z]) t[u][z]=++cnt,de[t[u][z]]=de[u]+1;
        dfs(y,t[u][z]);
    }
}
struct node{
    int u,v,w;
    il node(){u=v=w=0;}
    il node(int u,int v,int w) : u(u),v(v),w(w) {}
};
il node lcs(int x,int y){
    if(x==1 || y==1) return node(x,y,0);
    int ret=0,mi=lg[min(d[x],d[y])-1];
    for(int i=mi;i>=0;--i)
        if(fa[x][i] && fa[y][i] && h[x][i]==h[y][i]) x=fa[x][i],y=fa[y][i],ret+=(1<<i);
    return node(x,y,ret);
}
il int cmp(int x,int y){//x<y?1:0
    node cur=lcs(x,y);int len=cur.w,u=cur.u,v=cur.v;
    if(u!=1 && v!=1) return c[u]<c[v];
    if(len==d[x]-1 && len==d[y]-1) return x<y;
    return len==d[x]-1;
}
il int calc(int x,int y){
    if(x==y) return d[x]-1;
    x=rk[x],y=rk[y];if(x>y) swap(x,y);++x;
    int k=lg[y-x+1];
    return min(st[x][k],st[y-(1<<k)+1][k]);
}
int dfn[N],tot,siz[N],id[N];
void dfs1(int x){
    dfn[x]=++tot,id[tot]=x,siz[x]=1;
    int y=t[x][0],z=t[x][1];
    if(y) dfs1(y),siz[x]+=siz[y];
    if(z) dfs1(z),siz[x]+=siz[z];
    if(y && z){
        for(int i=dfn[y];i<dfn[y]+siz[y];++i)
            for(int j=dfn[z];j<dfn[z]+siz[z];++j)
                lcp[id[i]][id[j]]=lcp[id[j]][id[i]]=de[x];
    }
    if(y){
        for(int i=dfn[y];i<dfn[y]+siz[y];++i) lcp[id[i]][x]=lcp[x][id[i]]=de[x];
    }
    if(z){
        for(int i=dfn[z];i<dfn[z]+siz[z];++i) lcp[id[i]][x]=lcp[x][id[i]]=de[x];
    }
}
il void init(){
    cnt=0,tot=0;
    for(int i=1;i<=n;++i){
        e[i].clear(),c[i]=a[i]=v[i]=p[i]=d[i]=0,ans[i]=0ll;
        for(int j=0;j<20;++j) fa[i][j]=0,h[i][j]=0ull,st[i][j]=0;
        sa[i]=rk[i]=height[i]=0;

    }
    for(int i=0;i<=n;++i) t[i][0]=t[i][1]=de[i]=dfn[i]=siz[i]=id[i]=0;
}
il void ini(){
    pw[0]=1ull;lg[0]=-1;
    for(int i=1;i<N;++i) pw[i]=pw[i-1]*mul;
    for(int i=2;i<N;++i) lg[i]=lg[i>>1]+1;
}
int cur[N],mx[N];
int x,y,z,u,w;
int main(){
    //freopen("c1.in","r",stdin);
    scanf("%d",&T);ini();
    while(T--){
        scanf("%d",&n);init();
        for(int i=2;i<=n;++i) fa[i][0]=read(),c[i]=read(),add(fa[i][0],i,c[i]);
        for(int i=1;i<=n;++i) v[i]=read();
        for(int i=1;i<=n;++i) a[i]=read();
        de[0]=0,dfs(1,0);
        for(int i=1;i<=n;++i) sa[i]=i;
        stable_sort(sa+1,sa+1+n,cmp);
        for(int i=1;i<=n;++i) rk[sa[i]]=i;
        for(int i=2;i<=n;++i) height[i]=lcs(sa[i-1],sa[i]).w;
        for(int i=1;i<=n;++i) st[i][0]=height[i];
        for(int j=1;(1<<j)<=n;++j)
            for(int i=1;i+(1<<j)-1<=n;++i) st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
        dfs1(0);
        for(int x=1;x<=n;++x){
            for(int i=0;i<d[x];++i) mx[i]=0;
            for(int y=1;y<=n;++y){
                w=(x!=y?lcp[p[x]][p[y]]:d[x]-1);
                if(d[y]<d[x] || a[y]>w) continue;
                cur[y]=calc(x,y);if(cur[y]!=d[x]-1) continue;
                for(int i=a[y];i<=w;++i) cmax(mx[i],v[y]);
            }
            ans[x]=0ll;
            for(int i=0;i<d[x];++i) ans[x]+=1ll*mx[i];
        }

        for(int i=1;i<=n;++i) printf("%lld ",ans[i]);puts("");
    }




    return 0;
}