#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define db double
const int mod=1e9+7;
const int N=5e5+5;

int inv[N];
int fp(int ba,int pow){
    int r=1;
    while(pow){
        if(pow&1) r=r*ba%mod;
        ba=ba*ba%mod;
        pow>>=1;
    }
    return r;
}
vector<int> a;
vector<int> b;
vector<int> w;
vector<int> in;
vector<vector<int> > ed;
void abt(){
    int n;
    cin>>n;
    ed=vector<vector<int> > (n+1);
    a=vector<int> (n+1);
    b=vector<int> (n+1);
    w=vector<int> (n+1);
    in=vector<int> (n+1);
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=1;i<=n;i++) cin>>w[i];
    for(int i=1;i<=n;i++){
        if(b[i]==i) continue;
        if(a[b[i]]>a[i]){
            a[i]=(a[i]+w[i])%mod;
        }else if(a[b[i]]+w[b[i]]<=a[i]){
            continue;
        }else{
            in[i]++;
            ed[b[i]].push_back(i);
        }
    }
    queue<pair<int,int>> q;
    for(int i=1;i<=n;i++){
        if(in[i]==0) q.push({i,1});
    }
    while(!q.empty()){
        auto now=q.front();
        q.pop();
        for(auto i:ed[now.first]){
            a[i]=(a[i]+w[i]*inv[now.second+1]%mod)%mod;
            q.push({i,now.second+1});
        }
    }
    for(int i=1;i<=n;i++){
        cout<<a[i]<<" \n"[i==n];
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int tmp=1;
    for(int i=1;i<=500000;i++){
        tmp=tmp*i%mod;
    }
    tmp=fp(tmp,mod-2);
    for(int i=500000;i>=1;i--){
        inv[i]=tmp;
        tmp=tmp*i%mod;
    }
    int T=1;
    cin>>T;
    while(T--) abt();
    return 0;
}