#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, a, b) for(int i=(a);i<=(b);++i)
#define drep(i, a, b) for(int i=(a);i>=(b);--i)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)x.size()
#define endl "\n"
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18;

int fac[N];
int qpow(int a,int b){
    int res=1;a%=mod;
    while(b){
        if(b&1) res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}
int inv(int x){return qpow(x,mod-2);}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1), w(n + 1);
    rep(i, 1, n) cin >> a[i];
    rep(i, 1, n) cin >> b[i];
    rep(i, 1, n) cin >> w[i];

    vector<int> must(n + 1);
    vector<vector<int>> g(n + 1);
    rep(i, 1, n) {
        if(b[i]==i){
            must[i]=-1;
            continue;
        }
        if (a[i] < a[b[i]]) {
            must[i] = 1;
        }
        else if (a[i] >= a[b[i]]+w[b[i]]){
            must[i]=-1;
        }
        else{
            g[b[i]].push_back(i);
        }
    }
    vector<int> to(n+1);
    rep(i,1,n){
        if(must[i]==1){
            to[i]=1;
            function<void(int,int)> dfs=[&](int u,int pro){
                for(int v:g[u]){
                    to[v]=to[u]*(pro+1)%mod;
                    dfs(v,pro+1);
                }
            };
            dfs(i,1);
        }
        else if(must[i]==-1){
            function<void(int)> dfs=[&](int u){
                for(int v:g[u]){
                    if(must[v]) continue;
                    must[v]=-1;
                    dfs(v);
                }
            };
            dfs(i);
        }
    }
    rep(i,1,n){
        if(must[i]==-1) cout<<a[i]<<" ";
        else cout<<(a[i]+w[i]*inv(fac[to[i]])%mod)%mod<<" ";
    }
    cout<<endl;
}

signed main() {
    IOS
    fac[0]=1;
    rep(i,1,N-1) fac[i]=fac[i-1]*i%mod;
    int64_t tt = 1;
    cin >> tt;
    rep(kase, 1, tt) solve();
}