#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=5e5;
const int mod=1e9+7;
int ksm(ll x,int tp,int s=1){
    for(;tp;x=x*x%mod,tp>>=1) if(tp&1) s=x*s%mod;
    return s;
}
int fac[N+5],ifac[N+5];
void prep(){
    fac[0]=1;
    for(int i=1;i<=N;i++) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N],mod-2);
    for(int i=N;i;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
}
int n;
int a[N+5];
int b[N+5],w[N+5];
int len[N+5];
bool in[N+5];
int dfs(int u){
    if(len[u]!=-1) return len[u];
    if(in[u]) return -2;
    if(a[u]<a[b[u]]) return 0;
    if(a[u]>=a[b[u]]+w[b[u]]) return -2;
    in[u]=1;
    int t=dfs(b[u]);
    in[u]=0;
    if(t==-2) return -2;
    else return t+1;
}
void solve(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        len[i]=-1;
    }
    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(len[i]==-1){
            len[i]=dfs(i);
            if(len[i]!=-2) len[i]++;
        }
        if(len[i]==-2)
            printf("%d ",a[i]);
        else
            printf("%d ",(a[i]+1ll*ifac[len[i]]*w[i])%mod);
    }
    puts("");
}
int main(){
    prep();
    int t; scanf("%d",&t);
    while(t--) solve();
    return 0;
}