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

using i64 = long long;
const i64 mod = 1e9 + 7;

struct node {
    int u, c;
    i64 cal;

    node() {}
    node(int u, int c, i64 cal) : u(u), c(c), cal(cal) {}
};

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

i64 inv(i64 x) {
    return power(x, mod - 2);
}

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

    vector<i64> 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<i64> w(n);
    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }

    vector<i64> ans(n, -1);
    vector<vector<int>> e(n);

    vector<int> deg(n, 0);

    for (int i = 0; i < n; i++) {
        if (b[i] == i) {
            ans[i] = a[i];
            continue;
        }

        i64 cx = a[i], cy = a[b[i]];
        if (cy > cx) {
            ans[i] = a[i] + w[i];
            continue;
        }
        if (cx >= cy + w[b[i]]) {
            ans[i] = a[i];
            continue;
        }

        e[b[i]].push_back(i);
        deg[i]++;
    }

    for (int i = 0; i < n; i++) {
        if (deg[i] == 0 && ans[i] != -1 && ans[i] == a[i]) {
            int f = (ans[i] == a[i]);

            queue<int> q;
            q.push(i);

            while (!q.empty()) {
                auto u = q.front();
                q.pop();

                for (auto v : e[u]) {
                    ans[v] = a[v];
                    q.push(v);
                }
            }
        }
    }

    vector<int> pre(n, -1), vis(n, -1);
    vector<int> f;

    for (int i = 0; i < n; i++) {
        if (vis[i] == -1) {
            queue<pair<int, int>> q;
            vis[i] = i;
            q.emplace(i, i);

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

                for (auto v : e[u]) {
                    if (vis[v] == flag) {
                        f.push_back(u);
                    } else if (vis[v] == -1) {
                        vis[v] = flag;
                        pre[v] = u;
                        q.emplace(v, flag);
                    }
                }
            }
        }
    }

    for (auto u : f) {
        while (u != -1) {
            ans[u] = a[u];
            u = pre[u];
        }
    }

    vector<int> in(n, 0);
    vector<vector<int>> g(n);

    // cerr << "---" << endl;

    // for (int i = 0; i < n; i++) {
    //     cerr << e[i].size() << " \n"[i == n - 1];
    // }

    // for (int i = 0; i < n; i++) {
    //     if (in[i] != 0) {
    //         cerr << i + 1 << " ";
    //     }
    // }
    // cerr << endl;

    for (int i = 0; i < n; i++) {
        if (ans[i] == -1) {
            g[b[i]].push_back(i);
            in[i]++;
        }
    }

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

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

                for (auto v : g[u]) {
                    i64 nc = cal * inv(i64(c + 1)) % mod;
                    // cerr << cal << " " << inv(1LL * c + 1) << endl;
                    ans[v] = (a[v] + w[v] * nc) % mod;
                    q.emplace(v, c + 1, nc);
                }
            }
        }
    }

    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);

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

    return 0;
}