#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> Pair;
const int N=5e5+5,mod=1e9+7;
#define F first
#define S second
int a[N],b[N],w[N],fac[N],Inv[N];
int vis[N],inl[N],pos[N],lsiz[N];
int siz[N],fa[N],dep[N],top[N],son[N];
int T,n,cnt;
set<Pair> s1[N],s2[N];
vector<int> G[N];
inline int fastpow(int x, int y){
    int z=1;
    for (; y; y>>=1,x=1ll*x*x%mod)
        if (y&1) z=1ll*z*x%mod;
    return z;
}
void dfs1(int u, int f){
    dep[u]=dep[f]+1,siz[u]=1,fa[u]=f;
    for (int v:G[u]){
        dfs1(v,u);
        if (siz[v]>siz[son[u]]) son[u]=v;
    }
}
void dfs2(int u, int st){
    top[u]=st;
    if (son[u]) dfs2(son[u],st);
    for (int v:G[u])
        if (!top[v]) dfs2(v,v);
}
inline void Ins(int i){
    if (inl[i]) s2[pos[i]].insert({inl[i],i});
    else s1[top[i]].insert({dep[i],i});
}
inline void Del(int i){
    if (inl[i]) s2[pos[i]].erase({inl[i],i});
    else s1[top[i]].erase({dep[i],i});
}
inline Pair query_loop(int x){
    if (s2[pos[x]].empty()) return {-1,-1};
    auto it=s2[pos[x]].lower_bound({inl[x],0});
    if (it!=s2[pos[x]].end()) return {(*it).F-inl[x]+1,(*it).S};
    // printf("------->%d %d\n",x,s2[pos[x]].size()-inl[x]);
    return {(*s2[pos[x]].begin()).F+lsiz[pos[x]]-inl[x]+1,(*s2[pos[x]].begin()).S};
}
inline Pair query(int x){
    if (inl[x]) return query_loop(x);
    int rt=0;
    for (int i=x; i; i=fa[top[i]]){
        // if (i==2) printf("=-=-=>%d\n",i);
        auto it=s1[top[i]].upper_bound({dep[i],n+1});
        if (it!=s1[top[i]].begin()){
            it--;
            return {dep[x]-(*it).F+1,(*it).S};
        }
        if (fa[top[i]]==0) rt=top[i];
    }
    Pair ret=query_loop(rt);
    if (ret.F==-1) return ret;
    return {ret.F+dep[x]-1,ret.S};
}
int main(){
    fac[0]=Inv[0]=1;
    for (int i=1; i<=500000; i++) Inv[i]=fastpow(fac[i]=1ll*fac[i-1]*i%mod,mod-2);
    for (cin>>T; T; T--){
        scanf("%d",&n); cnt=0;
        for (int i=1; i<=n; i++) scanf("%d",&a[i]);
        for (int i=1; i<=n; i++) scanf("%d",&b[i]);
        for (int i=1; i<=n; i++) scanf("%d",&w[i]);
        for (int i=1; i<=n; i++){
            if (vis[i]) continue;
            int cur=i;
            for (; !vis[cur]; cur=b[cur]) vis[cur]=i;
            if (vis[cur]!=i) continue;
            cnt++;
            for (int j=1; !inl[cur]; cur=b[cur],j++) inl[cur]=j,pos[cur]=cnt;
        }
        for (int i=1; i<=n; i++)
            if (!inl[i]) G[b[i]].push_back(i);
            else lsiz[pos[i]]++;
        for (int i=1; i<=n; i++)
            if (inl[i]){
                dfs1(i,0);
                dfs2(i,i);
            }
        
        for (int i=1; i<=n; i++){
            if (a[i]<a[b[i]]) printf("A: %d\n",i);
            if (a[i]>=a[b[i]]+w[b[i]]) printf("B: %d\n",i);
            if (a[i]<a[b[i]] || a[i]>=a[b[i]]+w[b[i]]) Ins(i);
        }
            

        for (int i=1; i<=n; i++){
            Pair d=query(i);
            // printf("-->%d %d %d\n",i,d.F,d.S);
            if (d.F==-1 || a[d.S]>=a[b[d.S]]+w[b[d.S]]) printf("%d ",a[i]);
            else printf("%d ",(a[i]+1ll*w[i]*Inv[d.F])%mod);
        }
        puts("");
        /*
        int a[N],b[N],w[N],fac[N],Inv[N];
        int vis[N],inl[N],pos[N];
        int siz[N],fa[N],dep[N],top[N],son[N];
        int T,n,cnt;
        set<int> s1[N],s2[N];
        vector<int> G[N];
        */
        for (int i=1; i<=n; i++){
            s1[i].clear(),s2[i].clear(),G[i].clear();
            a[i]=b[i]=w[i]=0;
            vis[i]=inl[i]=pos[i]=lsiz[i]=0;
            siz[i]=fa[i]=dep[i]=top[i]=son[i]=0;
        }
    }
}
/*
1
5
508432375 168140163 892620793 578579275 251380640
3 4 4 1 3
346232959 736203130 186940774 655629320 607743104
*/