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

#define M 1000000007
#define N 500000

int i,j,k,n,m,t,fa[N+50],a[N+50],w[N+50],vis[N+50];
ll jc[N+50],inv[N+50];

ll su(ll a,ll b){a+=b;return (a>=M)?a-M:a;}
ll ksm(ll a,ll p){ll res=1;while(p){if(p&1){res=res*a%M;}a=a*a%M;p>>=1;}return res;}
ll c(ll n,ll m){if(n<m||n<0||m<0){return 0;}return jc[n]*inv[m]%M*inv[n-m]%M;}

ll f[N+50],g[N+50],res[N+50];

void fuck(int id){
	if(f[id]!=-1)return ;
	if(vis[id]){
		f[id]=g[id]=0;
		return;
	}
	
	if(a[id]<a[fa[id]])return void(f[id]=g[id]=1);
	if(a[id]>=a[fa[id]]+w[fa[id]])return void(f[id]=g[id]=0);
	
	vis[id]=1;
	
	fuck(fa[id]);
	f[id]=f[fa[id]]+1;
	g[id]=g[fa[id]];
	
	vis[id]=0;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	jc[0]=inv[0]=1;
	for(i=1;i<=N;i++)jc[i]=jc[i-1]*i%M;
	inv[N]=ksm(jc[N],M-2);
	for(i=N-1;i>=1;i--)inv[i]=inv[i+1]*(i+1)%M;
	
	cin>>t;
	while(t--){
		cin>>n;
		for(i=1;i<=n;i++)cin>>a[i];
		for(i=1;i<=n;i++)cin>>fa[i];
		for(i=1;i<=n;i++)cin>>w[i];
		fill(f+1,f+n+1,-1);
		fill(g+1,g+n+1,-1);
		fill(vis+1,vis+n+1,0);
		
		for(i=1;i<=n;i++){
			fuck(i);
			res[i]=(a[i]+w[i]*inv[f[i]]*g[i])%M;
		}
		
		for(i=1;i<=n;i++)cout<<res[i]<<' ';
		cout<<'\n';
	}
}