#include <bits/stdc++.h>
using namespace std;

#define rep(i,x) for (int i=0;i<(int)x;i++)
#define fore(i,x) for (auto &i:x)
#define For(i,x) for (int i=1;i<=(int)x;i++)
#define ll long long
#define vi vector<int>
#define pii pair<int,int>

const int mod = 1e9+7;

vector<int> jc;
vector<int> inv;

const int MAXN = 5e5+3;

int ksm(int x,int y){
    int res=1;
    while(y){
        if(y&1) res=(ll)res*x%mod;
        x=(ll)x*x%mod; y>>=1;
    }
    return res;
}

ll calc_inv(const int &x){
    if (x==0) return 1;
    return ksm(x,mod-2);
}

void pre(int x){
    jc.resize(x+5);
    inv.resize(x+5);
    jc[0]=1;
    for(int i=1;i<=x;++i) jc[i]=(ll)jc[i-1]*i%mod;
    inv[x]=ksm(jc[x],mod-2);
    for(int i=x-1;i>=0;--i) inv[i]=(ll)inv[i+1]*(i+1)%mod;
}

int C(int x,int y){
    if(x<y) return 0;
    return (ll)jc[x]*inv[y]%mod*inv[x-y]%mod;
}

int n;
int a[MAXN],b[MAXN],w[MAXN];
int ans[MAXN];
// int in[MAXN],out[MAXN];
vi g[MAXN];
ll INV;

void go(const int&x, const int &dep){
    // ans[]
    ll poss = C(n,dep) * jc[n-dep] % mod;
    ll val = (poss * w[x] %mod + jc[n] * a[x] % mod) % mod * INV % mod;
    ans[x]=val;

    fore(i,g[x]) go(i,dep+1);
}

void solve(){
    cin>>n;
    INV=calc_inv(jc[n]);
    rep(i,n){
        g[i].resize(0);
        // in[i]=0;
        // out[i]=0;
        ans[i]=-1;
    }
    rep(i,n) cin>>a[i];
    rep(i,n){
        cin>>b[i];
        b[i]--;
    }
    rep(i,n) cin>>w[i];

    rep(i,n){
        int fa=b[i];
        if (a[fa]+w[fa]>a[i] && a[fa]<=a[i]){
            g[fa].push_back(i);
        }
    }

    rep(i,n){
        int fa=b[i];
        if (a[i]<a[fa]){
            go(i,1);
        }
    }
    rep(i,n){
        if (ans[i]!=-1){
            cout<<ans[i]<<" ";
        }else{
            cout<<a[i]<<" ";
        }
    }
    cout<<endl;
}

int main(){
    int T;
    cin>>T;
    pre(500000);
    while (T--) solve();
    return 0;
}