#include <bits/stdc++.h>

using namespace std;
#define int long long
const int N=1e6+10;

int n,m; int p[N]; int mod=1e9+7;

void init(){
    p[0]=1;
    for(int i=1;i<N;i++) p[i]=p[i - 1]*i%mod;
}
int qmi(int a,int b){
    int res=1;
    while(b)
    {
        if(b & 1) res=res*a%mod;
        b>>=1; a=a*a%mod;
    }
return res;
}

int inv(int x) {
    return qmi(x, mod - 2);
}

vector<int> edges[N];
int d[N];
int ans[N];
int a[N], b[N], w[N];

void solve(){
    cin>>n;
    for(int i=0;i<=n;i++)
    {
        edges[i].clear();
        d[i]=0;
    }
    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 (a[i] >= a[b[i]] && a[i] < a[b[i]] + w[b[i]]) {
            d[i]++;
            edges[b[i]].emplace_back(i);
        }
        if (a[i] >= a[b[i]] + w[b[i]] || b[i] == i) {
            d[i] = 1;
            ans[i] = a[i];
        }
    }

    queue<int> q;
    for (int i = 1; i <= n; i++) {
        //cout << d[i] << " ";
        if (d[i] == 0) {
            q.emplace(i);
        }
    }
    int step = 1;
    while (!q.empty()) {
        int size = q.size();
        for (int i = 1; i <= size; i++) {
            int u = q.front(); q.pop();
            ans[u] = (a[u] + inv(p[step]) * w[u] % mod) % mod;
            for (auto v : edges[u]) {
                if (--d[v] == 0) {
                    q.emplace(v);
                }
            }
        }
        step++;
    }
    for (int i = 1; i <= n; i++) {
            if(ans[i])
        cout << ans[i] << ' ';
    else cout<<a[i]<<' ';
    }
    cout << endl;
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T=1; cin>>T;
    init();
    while(T--)
    {
      solve();
    }
return 0;
}