#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define gcd __gcd
using namespace std;
typedef pair<int,int> pii;
const int INF = 9e18;
const int inf = 2e9;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int qmi(int a,int k)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res * a % mod;
        k >>= 1;
        a =a * a % mod;
    }
    return res;
}
int inv(int x)
{
    return qmi(x,mod-2);
}
int MOD(int x)
{
    return (x % mod + mod) % mod;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >>t ;
    while(t --)
    {
        int n;
        cin >> n;
        vector<int> a(n + 1),b(n + 1),w(n + 1),p(n + 1,-1),f(n + 1);
        f[0] = 1;
        for(int i = 1;i <= n;i ++) f[i] = f[i-1] * i % mod;
        vector<array<int,2>> e(n + 1);
        vector<vector<int>> g(n + 1);
        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 ++) e[i] = {a[i],i};
        sort(e.begin()+1,e.end());
        for(int i = 1;i <= n;i ++)
        {
            if(b[i] != i)
            g[b[i]].push_back(i);
        }
        vector<int> ans(n + 1);

        auto dfs = [&](auto &&dfs,int u,int fa,int cnt) -> void
        {
            if(ans[u]) return ;
            int j = u;
            u = b[u];
            if(j == u)
            {
                ans[j] = a[j];
                cnt = 1;
            }
            else if(a[j] < a[u])
            {
                ans[j] = a[j] + w[j];
                cnt = 1;
            }
            else if(a[j] >= a[u] + w[u])
            {
                ans[j] = a[j];
                cnt = 1;
            }
            else
            {
                int ip = inv(f[cnt]);
                ans[j] = a[j] * MOD(1 - ip) % mod + (a[j] + w[j]) * ip % mod;
                ans[j] %= mod;
            }
            u = j;

            for(auto v : g[u])
            {
                if(v == fa || ans[v] > 0) continue;
                dfs(dfs,v,u,cnt + 1);
            }
        };

        for(int i = n;i >= 1;i --)
        {
            dfs(dfs,i,0,1);
        }
        for(int i = 1;i <= n;i ++) cout << ans[i] << ' ';
        cout << endl;
    }
 }