#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define p 1000000007
#define ll long long
int read(){
    int u=0;
    char c=getchar();
    while(c>'9'||c<'0')c=getchar();
    while(c>='0'&&c<='9'){
        u=u*10+c-48;
        c=getchar();
    }
    return u;
}
int ksm(int x,int y){
    if(!x)return 1;
    ll u=ksm(x/2,y);
    u=u*u%p;
    if(x&1)u=u*y%p;
    return u;
}
int n;
int a[500011],b[500011],w[500011],cb[500011];
int jc[500011],ny[500011],bz[500011],dis[500011];
vector<int>R[500011];
int ls[500011];
int d[500011];
void solve(){
    n=read();
    fo(i,1,n)bz[i]=dis[i]=cb[i]=0,R[i].clear();
    fo(i,1,n)a[i]=read();
    fo(i,1,n)b[i]=read(),R[b[i]].push_back(i);
    fo(i,1,n)w[i]=read();
    fo(i,1,n){
        if(R[i].size()&&!bz[i]){
            if(b[i]==i){
                bz[i]=1;
                continue;
            }
            int t=b[i],u=0;
            if(a[b[i]]>a[i])u=i;
            bz[i]=1;
            ls[t]=i;
            while(t!=i){
                if(a[b[t]]>a[t])u=t;
                bz[t]=1;
                ls[b[t]]=t;
                t=b[t];
            }
            if(!u)continue;
            dis[u]=1;
            t=ls[u];
            while(t!=u){
                if(a[b[t]]>a[t])dis[t]=1;
                else if(a[b[t]]+w[b[t]]>a[t]&&dis[b[t]])dis[t]=dis[b[t]]+1;
                t=ls[t];
            }
        }
    }
    fo(i,1,n)ls[i]=0;
    fo(i,1,n){
        fo(j,0,(int)R[i].size()-1){
            if(!bz[R[i][j]]){
                ls[i]=R[i][j];
                cb[R[i][j]]++;
            }
        }
    }
    int h=0;
    fo(i,1,n){
        if(!cb[i])d[++d[0]]=i;
    }
    while(h<d[0]){
        int t=d[++h];
        if(!dis[t]){
            if(a[b[t]]>a[t])dis[t]=1;
            else if(a[b[t]]+w[b[t]]>a[t]&&dis[b[t]])dis[t]=dis[b[t]]+1;
        }
        if(ls[t]){
            cb[ls[t]]--;
            if(!cb[ls[t]]){
                d[++d[0]]=ls[t];
            }
        }
    }
    ny[0]=0;
    fo(i,1,n){
        ll ans=a[i]+(ll)w[i]*ny[dis[i]]%p;
        ans%=p;
        printf("%lld ",ans);
    }
    puts("");
}
int main(){
    jc[0]=ny[0]=1;
    fo(i,1,5e5){
        jc[i]=(ll)jc[i-1]*i%p;
        ny[i]=ksm(p-2,jc[i]);
    }
    int T=read();
    while(T){
        --T;
        solve();
    }
    return 0;
}