#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <random>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll ,ll > 
#define endl '\n'
const double pai = acos(-1);
ll extend_gcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n, ll mod)
{
    ll ans = 1;
    a %= mod;
    while (n)
    {
        if (n & 1)
            ans = (ans * a)%mod; //% mod
        a = (a * a)%mod;         //% mod
        n >>= 1;
    }
    return ans;
}
int dir[4][2] =
    {
        {0, 1}, {0, -1}, {1, 0}, {-1, 0}}; // d a w s

const ll inf = 1000000000000000000ll;
const ll mod = 1e9 + 7, P1 = 13331;
const double eps = 1e-7;
const int N = 5e5 + 10, M = 1e6 + 10;

ll inverse(ll a)
{
    return fastpow(a,mod-2,mod);
}

ll jiecheng[N];

ll gailv[N];

int t,n;
ll a[N],w[N];
ll b[N];

int zhuangtai[N];

bool vis[N];

stack<int > st;

ll qiwang[N];

void dfs(int u)
{
   // cout<<"CUR: "<<u<<endl;
     
    st.push(u);
    if(a[b[u]]>a[u])//yiding
    {
        int temp=0;

        while(st.size())
        {
            //cout<<st.top()<<endl;

            temp++;
            ll jia=w[st.top()]*inverse(jiecheng[temp])%mod;
            qiwang[st.top()]=jia;
            zhuangtai[st.top()]=2;

            st.pop();
        }
        return;
    }

    if(  a[b[u]]+w[b[u]]<=a[u]    )//bukeneng
    {
        while(st.size())
        {
            
            zhuangtai[st.top()]=-1;
            st.pop();
        }
        return;
    }
   // cout<<"CUR:xiamian "<<u<<endl;
    if(vis[u]&&zhuangtai[u]==0)//huan
    {
        while(st.size())
        {
            
            zhuangtai[st.top()]=-1;
            st.pop();
        }
        return;
    }

   
    //
    //cout<<u<<endl;

    vis[u]=1;
    dfs(b[u]);

}



int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   // freopen("ain.txt", "r", stdin);freopen("aout.txt", "w", stdout);
    jiecheng[0]=1ll;
    rep(i,1,500000)
    {
        jiecheng[i]=jiecheng[i-1]*1ll*i;
        jiecheng[i]%=mod;
        //
        
    }

    cin>>t;
    while(t--)
    {
        cin>>n;
        fill(vis+1,vis+n+1,0);
        fill(zhuangtai+1,zhuangtai+n+1,0);
        fill(gailv+1,gailv+n+1,0);
        fill(qiwang+1,qiwang+n+1,0);
        rep(i,1,n)
        {
            cin>>a[i];
        }
        rep(i,1,n)
        {
            cin>>b[i];
        }
        rep(i,1,n)
        {
            cin>>w[i];
        }
        rep(i,1,n)
        {
            if(zhuangtai[i]||vis[i])
            {
                continue;
            }
            dfs(i);
        }
        rep(i,1,n)
        {
            qiwang[i]+=a[i];
            qiwang[i]%=mod;
            cout<<qiwang[i]<<" ";
            
        }
        cout<<endl;
    }

    return 0;
}