#include <bits/stdc++.h>

#define endl '\n'
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll JC[500005];
ll inv[500005];
bool vis[500005];
ll n;
ll power(ll x,ll y){
    ll res=1;
    while(y>0){
        if(y&1)
            res=(res*x)%mod;
        x=(x*x)%mod;
        y>>=1;
    }
    return res;
}
void dfs(ll u,vector<ll> &a,vector<ll> &b,vector<ll> &w,vector<ll> &cnt,vector<ll> &num){
    ll nex=b[u];
    vis[u]=true;
    if(a[nex]>a[u]){
        cnt[u]=JC[n];
        vis[u]=false;
        return;
    }
    else if(a[nex]+w[nex]<=a[u]){
        cnt[u]=0;
        vis[u]=false;
        return;
    }
    else {
        if(vis[nex]){
            cnt[u]=0;
            num[u]=0;
            vis[u]=false;
            return;
        }
        dfs(nex,a,b,w,cnt,num);
        num[u]=num[nex]+1;
        num[u]%=mod;
        ll tol=num[u]+1;
        tol%=mod;
        cnt[u]=(((JC[n-tol]*inv[n-tol])%mod*JC[n]%mod)*inv[tol]%mod);
    }
    vis[u]=false;
}
void solve() {
    cin >> n;
    vector<ll> a(n + 1), b(n + 1), w(n + 1);
    ll sum=0;
    for (ll i = 1; i <= n; i++) {
        cin >> a[i];
        sum+=a[i];
        sum%=mod;
    }
    for (ll i = 1; i <= n; i++) {
        cin >> b[i];
    }
    for (ll i = 1; i <= n; i++) {
        cin >> w[i];
    }
    vector<ll> cnt(n + 1, -1);
    vector<ll> num(n + 1, 0);
    for (ll i = 1; i <= n; i++) {
        if (cnt[i] != -1)
            continue;
        if (a[i] < a[b[i]]) {
            cnt[i] = JC[n];
        }
        else if(a[i]>a[b[i]]+w[b[i]]){
            cnt[i]=0;
        }
        else{
            dfs(i,a,b,w,cnt,num);
        }
    }
    for(ll i=1;i<=n;i++){
        ll all=(JC[n]-cnt[i]+mod)%mod;
        ll ans=(all*a[i]%mod+cnt[i]*((w[i]+a[i])%mod)%mod)*inv[n]%mod;
        cout<<ans<<" ";
    }
    cout<<endl;
}
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    JC[0]=1;
    inv[0]=1;
    for(ll i=1;i<=500000;i++){
        JC[i]=(JC[i-1]*i)%mod;
        inv[i]=power(JC[i],mod-2);
    }
    ll t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}