#include <bits/stdc++.h>

const int64_t MOD = 1E9 + 7;

int64_t power(int64_t a, int64_t b, int64_t p)
{
    int64_t res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}

int64_t inv(int64_t a, int64_t p) 
{
    return power(a, p - 2, p);
}

void solve() 
{
    int n;
    std::cin >> n;
    std::vector<int> a(n), b(n), w(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        std::cin >> b[i];
        b[i]--;
    }
    for (int i = 0; i < n; ++i) {
        std::cin >> w[i];
    }
    std::vector<std::vector<int>> adj(n);
    std::vector<int64_t> ans(n, -1);
    for (int i = 0; i < n; ++i) {
        adj[b[i]].push_back(i);
        if (a[i] < a[b[i]]) {
            ans[i] = (a[i] + w[i]) % MOD;
        } else if (a[i] >= a[b[i]] + w[b[i]]) {
            ans[i] = a[i];
        } else if (i == b[i]) {
            ans[i] = a[i];
        }
    }
    std::vector<bool> vis(n);
    auto fix = [&](auto self, int u) -> void {
        vis[u] = true;
        for (const auto &v : adj[u]) {
            if (ans[v] != -1) continue;
            if (a[v] >= a[u]) {
                ans[v] = a[v];
                self(self, v);
            } else if (a[v] < a[u]) {
                ans[v] = (a[v] + w[v]) % MOD;
            }
        }
    };
    for (int i = 0; i < n; ++i) {
        if (!vis[i] && ans[i] == a[i] && i != b[i]) fix(fix, i);
    }
    auto cal = [&](auto self, int u, int len, int64_t p) -> void {
        if (ans[u] == -1) {
            ans[u] = p * ((a[u] + w[u]) % MOD) % MOD + (1 - p + MOD) % MOD % MOD * a[u] % MOD; 
        }
        int64_t np = p * inv(len + 1, MOD) % MOD;
        for (const auto &v : adj[u]) {
            if (ans[v] != -1) continue;
            self(self, v, len + 1, np);
        }
    };
    for (int i = 0; i < n; ++i) {
        if (ans[i] == (a[i] + w[i]) % MOD) {
            cal(cal, i, 1, 1);
        }
    }
    for (int i = 0; i < n; ++i) {
        std::cout << ans[i] << " \n"[i == n - 1];
    }
}

int main() 
{
    std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
    
    int t;
    std::cin >> t;
    while(t--) {
        solve();
    }
    
    return 0;
}