#include<bits/stdc++.h>
using namespace std;
constexpr int N=500005;
constexpr int MOD=1000000007;
int qpow(int a,int b)
{
    int res=1;
    while(b)
    {
        if(b&1) res=(long long)res*a%MOD;
        a=(long long)a*a%MOD,b>>=1;
    }
    return res;
}
int getinv(int x)
{
    return qpow(x,MOD-2);
}
int fac[N],ifac[N];
void init(int n)
{
    fac[0]=1;
    for(int i=1;i<=n;i++)
        fac[i]=(long long)fac[i-1]*i%MOD;
    ifac[n]=getinv(fac[n]);
    for(int i=n;i>=1;i--)
        ifac[i-1]=(long long)ifac[i]*i%MOD;
    return;
}
int n;
int a[N],b[N],w[N];
int dis[N];
bool vis[N];
vector<int>G[N];
void dfs(int u,int father)
{
    vis[u]=true;
    dis[u]=dis[father]+1;
    for(int v:G[u])
        dfs(v,u);
    return;
}
void solve()
{
    cin>>n;
    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++)
        vis[i]=false,G[i].clear();
    for(int i=1;i<=n;i++)
    {
        if(a[i]<a[b[i]]) vis[i]=true;
        else if(a[i]>=a[b[i]]+w[b[i]]) vis[i]=false;
        else G[b[i]].emplace_back(i);
    }
    for(int i=1;i<=n;i++)
        if(vis[i]) dfs(i,0);
    for(int i=1;i<=n;i++)
    {
        int ans=0;
        if(vis[i]) ans=(a[i]+(long long)ifac[dis[i]]*w[i])%MOD;
        else ans=a[i];
        cout<<ans<<" ";
    }
    cout<<"\n";
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    init(500000);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}