#include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10, MOD = 1e9 + 7;


vector<int> a, b, w, fa, Arrangement(N), dep;
int mpow(int a, int b)
{
    int res = 1;
    while (b)
    {
        if (b & 1)
            res = 1ll * res * a % MOD;
        a = 1ll * a * a % MOD;
        b >>= 1;
    }
    return res;
}
int find(int x) {
    std::stack<int> stack;
    stack.push(x);

    while (!stack.empty()) {
        int current = stack.top();
        stack.pop();

        if (dep[current]) {
            continue;
        }

        if (fa[current] && fa[current] != current) {
            stack.push(current);
            stack.push(fa[current]);
        } else if (fa[current] == current) {
            dep[current] = 1;
        } else {
            dep[current] = -MOD;
        }

        if (!stack.empty() && dep[stack.top()]) {
            dep[current] = dep[stack.top()] + 1;
        }
    }

    return dep[x];
}


int solve(int x)
{
    if (fa[x] == 0)
        return a[x] % MOD;
    else if (fa[x] == x)
        return (a[x] + w[x]) % MOD;
    int d = find(x);
    if (d < 0)
        return a[x] % MOD;
    return (a[x] + 1ll * w[x] * mpow(Arrangement[d], MOD - 2) % MOD) % MOD;
}
int main()
{
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    Arrangement[0] = 1;
    for (int i = 1; i < N; i++)
        Arrangement[i] = 1ll * Arrangement[i - 1] * i % MOD;
    while (T--)
    {
        int n;
        cin >> n;
        a.resize(n + 5);
        b.resize(n + 5);
        w.resize(n + 5);
        fa.resize(n + 5);
        dep.resize(n + 5);
        for (int i = 1; i <= n; i++)
            cin >> a[i], fa[i] = dep[i] = 0;
        for (int i = 1; i <= n; i++)
            cin >> b[i];
        for (int i = 1; i <= n; i++)
            cin >> w[i];
        for (int i = 1; i <= n; i++)
        {
            if (i == b[i])
                fa[i] = 0;
            else if (a[i] < a[b[i]])
                fa[i] = i;
            else if (a[i] < w[b[i]] + a[b[i]])
                fa[i] = b[i];
            else
                fa[i] = 0;
        }
        for (int i = 1; i <= n; i++)
            cout << solve(i) << " ";
        cout << endl;
    }
    return 0;
}