#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),cnt(n + 1,1),f(n + 1);
        vector<array<int,2>> e(n + 1);
        f[0] = 1;
        for(int i = 1;i <= n;i ++) f[i] = f[i-1] * i % mod;
        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());
        vector<int> vis(n + 1);
        auto dfs =[&](auto &&dfs,int u) -> void
        {
            if(vis[u]) return ;
            vis[u] = 1;
            if(u == b[u])
            {

            }
            else if(a[u] >= a[b[u]] && a[u] < a[b[u]] + w[b[u]])
            {
                dfs(dfs,b[u]);
                cnt[u] += cnt[b[u]];
            }
        };
        
        for(int i = 1;i <= n;i ++) dfs(dfs,e[i][1]);
        vector<int> ans(n + 1);
        for(int i = 1;i <= n;i ++)
        {
            int x = inv(f[cnt[i]]);
            // if(cnt[i] == 1) cout << x << ' ';
            // cout << x << ' ';
            if(cnt[i] != 1)
            ans[i] = a[i] * MOD(1 - x) % mod + (a[i] + w[i]) * x % mod;
            else
            {
                if(a[i] < a[b[i]]) ans[i] = a[i] + w[i];
                else ans[i] = a[i];
            }
            cout << ans[i] % mod << ' ';
        }
        cout << endl;
    }
 }