#include<bits/stdc++.h>
using namespace std;
#define Re register int
#define ll long long

const int N = 500005, Mod = 1e9 + 7;
int T, n, cnt, top, res, a[N], b[N], w[N], hea[N], nxt[N], to[N], q[N], d[N], f[N], len[N];
bool vis[N];

inline void add(int x, int y)
{
    nxt[++cnt] = hea[x], to[cnt] = y, hea[x] = cnt;
}

inline ll fpow(ll x, int y)
{
    ll ans = 1;
    while (y)
    {
        if (y & 1) ans = ans * x % Mod;
        x = x * x % Mod, y >>= 1;
    }
    return ans;
}

inline void dfs(int x)
{
    if (vis[x])
    {
        while (top && q[top] ^ x) d[++res] = q[top--];
        if (top) d[++res] = x;
        return;
    }
    vis[x] = 1, q[++top] = x;
    dfs(b[x]);
}

inline void dfs1(int x)
{
    for (Re i = hea[x]; i; i = nxt[i])
    {
        int u = to[i];
        if (f[u] != -1) continue;
        len[u] = len[x] + 1, f[u] = 1ll * f[x] * fpow(len[u], Mod - 2) % Mod;
        dfs1(u);
    }
}

int main()
{
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &n);
        cnt = 0;
        for (Re i = 1; i <= n; ++i) hea[i] = vis[i] = 0, len[i] = 1, f[i] = -1;
        for (Re i = 1; i <= n; ++i) scanf("%d", &a[i]);
        for (Re i = 1; i <= n; ++i) scanf("%d", &b[i]), add(b[i], i);
        for (Re i = 1; i <= n; ++i) scanf("%d", &w[i]);
        for (Re i = 1; i <= n; ++i)
            if (a[i] >= a[b[i]] + w[b[i]]) f[i] = 0;
            else if (a[i] < a[b[i]]) f[i] = 1;
        //printf("!!%d\n", f[1]);
        for (Re i = 1; i <= n; ++i)
            if (!vis[i])
            {
                res = top = 0;
                dfs(i);
                //printf("==%d\n", res);
                if (!res) continue;
                bool p = 0;
                for (Re j = 1; j <= res; ++j)
                    if (f[d[j]] != -1)
                    {
                        p = 1;
                        break;
                    }
                if (!p)
                    for (Re j = 1; j <= res; ++j) f[d[j]] = 0;
            }
        //printf("!!%d\n", f[1]);
        for (Re i = 1; i <= n; ++i)
            if (f[i] != -1) dfs1(i);
        for (Re i = 1; i <= n; ++i)
        {
            ll ans = (1ll * w[i] * f[i] + a[i]) % Mod;
            printf("%lld ", ans);
        }
        putchar('\n');
    }
    return 0;
}