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

#define int long long
#define lep(i,a,b) for(int i=(a); i <= (b); i++)
#define pb push_back

const int maxn = 6e5 + 5;
int fact[maxn], ifact[maxn];

const int mod = 1e9 + 7;
int reduce(int a) {
    return (a %= mod) < 0 ? a + mod : a;
}

int add(int x, int y) {
    return reduce(x+y);
}

int prod(int x, int y) {
    return reduce(x * y);
}

int modpow(int a, int pw) {
    if (a == 0) return 0;
    if (pw == 0) return 1;
    if (pw % 2 == 0) {
        int res = modpow(a,pw/2);
        return prod(res, res);
    }
    return prod(a, modpow(a,pw-1));
}

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

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    fact[0] = ifact[0] = 1;
    lep(i,1,maxn-1) {
        fact[i] = prod(i, fact[i-1]);
        ifact[i] = inv(fact[i]);
    }
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n+1), b(n+1), w(n+1);
        vector<int> typ(n+1);
        vector<vector<int>> adj(n+1);
        vector<int> depth(n+1, -1);
        lep(i,1,n) {
            cin >> a[i];
        }
        lep(i,1,n) {
            cin >> b[i];
        }
        lep(i,1,n) {
            cin >> w[i];
        }
        lep(i,1,n) {
            if (i == b[i] or a[i] >= a[b[i]] + w[b[i]]) typ[i] = 2;
            else if (a[i] < a[b[i]]) typ[i] = 0;
            else typ[i] = 1;
        }
        lep(i,1,n) {
            // consider (b[i], i)
            int u = b[i];
            int v = i;
            if (typ[u] <= 1 and typ[v] == 1) adj[u].pb(v);
        }

        auto dfs = [&](auto &self, int u, int p) -> void {
            for (int v: adj[u]) {
                if (v != p) {
                    depth[v] = depth[u] + 1;
                    self(self, v, u);
                }
            }
        };

        lep(i,1,n) {
            if (typ[i] == 0) {
                depth[i] = 0;
                dfs(dfs,i,0);
            }
        }
        vector<int> ans(n+1);
        lep(i,1,n) {
            // cout << "i: " << i << ", typ[i]: " << typ[i] << ", depth[i]: " << depth[i] << "\n";
            if (typ[i] == 0) {
                ans[i] = a[i] + w[i];
            } else if (typ[i] == 1) {
                if (depth[i] != -1) ans[i] = add(a[i], prod(inv(fact[depth[i]+1]), w[i]));
                else ans[i] = a[i];
            } else {
                ans[i] = a[i];
            }
        }
        lep(i,1,n) {
            cout << ans[i] << " ";
        }
        cout << "\n";
    }
}

// Output for sample:

// 5 5 5 6 
// 5 10 9 
// 500000009 6 6 
// 3 4 3 4 5


// Third case:

// 1
// 3
// 5 4 3
// 2 3 1
// 1 2 3

// i: 1, typ[i]: 1, depth[i]: 2
// i: 2, typ[i]: 1, depth[i]: 1
// i: 3, typ[i]: 0, depth[i]: 0
// 333333341 5 6