#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+10;
const int mod=1e9+7;
#define ll long long
struct node
{
    int to;
};
vector<node> h[N];
int dis[N];
int n;
int a[N],b[N],w[N];
int d[N];
ll fact[N],infact[N];
int ans=0;
int color[N];
int kk[N];
ll qmi(ll a,ll b,ll p)
{
    ll cnt=1;
    while(b)
    {
        if(b&1) cnt=(cnt*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return cnt;
}
void add(int a,int b)
{
    h[a].push_back({b});
    d[b]++;
}
void bfs(int pos)
{
    queue<int> q;
    q.push(pos);
    dis[pos]=1;
    while(q.size())
    {
        auto t=q.front();
        q.pop();
        for(int i=0;i<h[t].size();i++)
        {
            int j=h[t][i].to;
            if(dis[j]!=0) continue;
            dis[j]=dis[t]+1;
            d[j]--;
            kk[j]=infact[dis[j]]*(a[j]+w[j])%mod+(1-infact[dis[j]]+mod)%mod*a[j]%mod;
          //  ans=(ans+infact[dis[j]]*w[j]%mod)%mod;
            q.push(j);
        }
    }

}
void solve()
{
    for(int i=1;i<=n;i++)
    {
        h[i].clear();
        d[i]=0;
        dis[i]=0;
        color[i]=0;
    }
    ans=0;
    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++)
    {
        if(a[b[i]]<=a[i]&&a[b[i]]+w[b[i]]>a[i]) //可能加
        {
            color[i]=3;
        }
        else if(a[b[i]]<=a[i]&&a[b[i]]+w[b[i]]<=a[i]) //不加
        {
            color[i]=2;
        }
        else color[i]=1; //加
    }
    for(int i=1;i<=n;i++)
    {
        //cout<<color[i]<<"aa";
        if(color[i]==2) kk[i]=a[i];
        else if(color[i]==1) kk[i]=(w[i]+a[i])%mod;
        else
        {
            if(color[b[i]]==1||color[b[i]]==3)
            {
                add(b[i],i);
               // cout<<b[i]<<"aa"<<i<<endl;
            }
            else
            {
                kk[i]=a[i];
            }
        }
    }
   // cout<<endl;
    for(int i=1;i<=n;i++)
    {
        if(dis[i]==0&&d[i]==0&&color[i]==1) 
        {
            bfs(i);
            //cout<<i<<"aa"<<endl;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(d[i]!=0)
        {
            kk[i]=a[i];
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<kk[i]<<' ';
    }
    cout<<endl;

}
signed main()
{
    //cout<<qmi(2,mod-2,mod)<<endl;
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    fact[0]=infact[0]=1;
    for(ll i=1;i<N;i++)  //此处不能取到N,否则数组越界
    {
        fact[i]=(fact[i-1]*i)%mod;
        infact[i]=(infact[i-1]*qmi(i,mod-2,mod))%mod;
    }
    while(T--)
    {
        solve();
    }
}