#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const int N = 5e5 + 10;
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

ll qpow(ll a, ll n)
{
    ll res = 1;
    while (n)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

struct egde
{
    int to, ne;
} e[maxn];
int head[N], ecnt;

void add(int x, int y)
{
    e[++ecnt].to = y;
    e[ecnt].ne = head[x];
    head[x] = ecnt;
}

ll a[N], b[N], w[N];
int fa[N];
bool vis[N];

ll P[N];
ll ans[N], in[maxn];
bool ok = 0;

int getfa(int x)
{
    // cout << x << ' ';
    while (fa[x] != 0)
        x = fa[x];
    return x;
}

void dfs(int x, int f, int dep, bool op)
{
    vis[x] = 1;
    // cout << w[b[x] ] << ' ' << P[dep] << endl;
    if (!op)
        ans[x] = (P[dep] * w[x] % mod + a[x]) % mod;
    else
        ans[x] = a[x];
    for (int i = head[x]; i; i = e[i].ne)
    {
        int y = e[i].to;
        if (y == f)
            continue;
        dfs(y, x, dep + 1, op);
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll res = 1;
    for (int i = 1; i < N; i++)
    {
        res = res * i % mod;
        P[i] = qpow(res, mod - 2) % mod;
    }
    int T;
    cin >> T;
    while (T--)
    {
        int n;
        cin >> n;

        for (int i = 0; i <= n + 5; i++)
        {
            head[i] = 0;
            fa[i] = vis[i] = in[i] = 0;
        }
        ecnt = 0;

        for (int i = 1; i <= n; i++)
            cin >> a[i];
        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]) continue;
            if (a[i] >= a[b[i]] && a[i] < a[b[i]] + w[b[i]])
            {
                // cout << i << ' '
                if (i != b[i])
                {
                    in[i]++;
                    add(b[i], i);
                    fa[i] = b[i];
                }

                // cout << b[i] << ' ' << i << endl;
            }
        }

        // for (int i = 1; i <= n; i++)
        //     cout << fa[i] << ' ';
        // cout << endl;

        for (int i = 1; i <= n; i++)
        {
            if (!in[i])
            {
                // if (i == fa[i])
                // {
                //     ans[i] = a[i] % mod;
                //     vis[i] = 1;
                //     continue;
                // }

                // if (a[i] >= a[b[i]] + w[b[i]])
                // {
                //     // cout << i << ' ';
                //     ans[i] = a[i] % mod;
                //     vis[i] = 1;
                //     continue;
                // }

                ok = 0;
                int root = i;
                // int root = getfa(i);
                if (a[root] >= a[b[root]] + w[root])
                    ok = 1;
                if (root == b[root])
                    ok = 1;
                // cout << root << ' ';
                // if (root = 1)
                // cout << root << ' ';
                dfs(root, 0, 1, ok);
            }
        }

        for (int i = 1; i <= n; i++)
            cout << ans[i] << ' ';
        cout << endl;
    }
}