#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7,N=5e5+2e2;
ll a[N],b[N],w[N],ans[N],way[N],fact[N];
ll ksm(ll a,ll b){
	ll sz=a;
	ll ans=1;
	while(b){
		if(b&1)ans=ans*sz%mod;
		sz=sz*sz%mod;
		b>>=1;
	}
	return (ans+mod)%mod;
}

void solve(int i){
	if(b[i]==i){
		ans[i]=a[i];
		way[i]=1;
		return;
	}
	if(a[i]<a[b[i]]){
		ans[i]=a[i]+w[i];
		way[i]=1;
		return ;
	}
	else if(a[i]>=a[b[i]]+w[b[i]]){
		ans[i]=a[i];
		way[i]=1;
		return ;
	}
	else{
		if(way[b[i]]==-1){
			solve(b[i]);
		}
		ll temp=ksm(fact[way[ b[i] ]+ 1 ],mod-2);
		ans[i]=((a[i]+w[i])*temp%mod+a[i]*(fact[way[ b[i] ]+ 1 ]-1+mod)*temp%mod+mod)%mod;
		way[i]=way[b[i]]+1;
		return;
	}
}



int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	fact[0]=1;
	for(ll i=1;i<=5e5;i++){
		fact[i]=fact[i-1]*i%mod;
	}
	int T;
	cin>>T;
	while(T--){
//		memset(way,-1,sizeof way);
		ll n;
		cin>>n;
		for(int i=1;i<=n;i++)way[i]=-1;
		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++){
//			cout<<"y\n";
			if(way[i]==-1)solve(i);
			cout<<ans[i]<<' ';
		}
		cout<<"\n";
		
		
		
	}
	
}