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

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

vector<int> inv(N, 1);

int power(int x, int n) {
    i64 ret = 1;
    while (n > 0) {
        if (n & 1) {
            ret = ret * x % mod;
        }
        x = 1LL * x * x % mod;
        n >>= 1;
    }
    return int(ret);
}

void solve() {
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<int> b(n);
    for (int i = 0; i < n; i++) {
        cin >> b[i];
        b[i]--;
    }

    vector<int> w(n);
    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }

    vector<int> col(n, 0);
    // 1 impossible
    // 2 must
    vector<vector<int>> e(n);

    for (int i = 0; i < n; i++) {
        if (b[i] == i || a[i] >= a[b[i]] + w[b[i]]) {
            col[i] = 1;
            continue;
        }
        if (a[i] < a[b[i]]) {
            col[i] = 2;
            continue;
        }
        e[b[i]].push_back(i);
    }

    vector<int> vis(n, -1);
    vector<pair<int, int>> cir;
    auto dfs = [&](auto self, int u, int c) -> void {
        vis[u] = c;
        for (auto v : e[u]) {
            if (vis[v] == -1) {
                self(self, v, c);
            } else if (vis[v] == c) {
                cir.emplace_back(u, v);
            }
        }
    };
    for (int i = 0; i < n; i++) {
        if (vis[i] == -1) {
            dfs(dfs, i, i);
        }
    }

    // cerr << "ok" << endl;

    for (auto [u, stop] : cir) {
        while (u != stop) {
            col[u] = 1;
            u = b[u];
        }
        col[stop] = 1;
    }

    vector<int> in(n, 0);
    vector<vector<int>> g(n);
    for (int i = 0; i < n; i++) {
        if (col[i] == 0 && col[b[i]] != 1) {
            g[b[i]].push_back(i);
            in[i]++;
        }
    }

    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        if (col[i] == 1) {
            ans[i] = a[i];
        } else if (col[i] == 2) {
            ans[i] = (a[i] + w[i]) % mod;
        }

        if (in[i] == 0) {
            queue<pair<int, int>> q;
            q.emplace(i, 1);

            while (!q.empty()) {
                auto [u, dep] = q.front();
                q.pop();

                for (auto v : g[u]) {
                    q.emplace(v, dep + 1);
                    ans[v] = (1LL * a[v] + 1LL * w[v] * inv[dep + 1] % mod) % mod;
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << ans[i] << " \n"[i == n - 1];
    }
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    for (int i = 2; i < N; i++) {
        inv[i] = 1LL * inv[i - 1] * power(i, mod - 2) % mod;
    }

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}