#include<bits/stdc++.h>
using namespace std;

using ll = long long;

const int mod = 1e9 + 7;
const int N = 5e5 + 5;

ll fac[N], inv[N];
bool vis[N];
vector<int> adj[N];
vector<int> order;
int d[N];

ll binpow(ll a, ll b, ll mod){
    ll res = 1;
    while(b){
        if(b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}


void dfs(int u, bool is_later){
    for(int v: adj[u]){
        if(!vis[v]){
            vis[v] = true;
            if(is_later)d[v] = d[u] + 1;
            dfs(v, is_later);
        }
    }
    if(!is_later)order.push_back(u);
}
ll mul(ll a, ll b){
    return a * b % mod;
}
ll sub(ll a, ll b){
    a -= b;
    if(a < 0) a += mod;
    return a;
}
ll add(ll a, ll b){
    a += b;
    return a % mod;
}
void init(int n){
    for(int i = 0; i < n; i++){
        adj[i].clear();
        vis[i] = false;
        d[i] = 0;
    }

    order.clear();
}
void solve(){
    int n;
    cin >> n;
    init(n);
    vector<int> a(n), b(n), w(n), ans(n);
    for(auto &x: a)cin>>x;
    for(int i = 0; i < n; i++){
        cin >> b[i]; b[i]--;
    }
    for(auto &x: w)cin>>x;
    for(int i = 0; i < n; i++){
        if(a[i] >= a[b[i]] + w[b[i]] || i == b[i]){
            ans[i] = a[i] % mod;
            continue;
        }
        if(a[i] < a[b[i]]){
            ans[i] = (a[i] + w[i]) % mod;
            continue;
        }
        adj[b[i]].push_back(i);
    }
    for(int i = 0; i < n; i++){
        if(!vis[i]){
            vis[i] = true;
            dfs(i, 0);
        }
    }
    reverse(order.begin(), order.end());
    for(int i = 0; i < n; i++)vis[i] = false;
    
    for(auto &x: order){
        if(!vis[x]){
            vis[x] = true;
            dfs(x, 1);
        }
    }
    
    for(int i = 0; i < n; i++){
        if(!ans[i]){
            ans[i] = add(mul(inv[d[i] + 1], a[i] + w[i]), mul(sub(1, inv[d[i] + 1]), a[i]));
        }
    }
    for(int i = 0; i < n; i++){
        cout << ans[i] << " \n"[i == n - 1];
    }
}
int main() {
    int t;
    cin >> t;
    fac[0] = 1;
    for(int i = 1; i < N; i++){
        fac[i] = (fac[i - 1] * i) % mod;
        inv[i] = binpow(fac[i], mod - 2, mod);
    }
    while(t--){
        solve();
    }
}