#include<bits/stdc++.h>
#define mod 1000000007
#define int long long
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int a[500005],b[500005],w[500005];
int zt[500005],dp[500005];
void dfs(int x)
{
	if(zt[x]!=-2)return;
	if(b[x]==x)
	{
		zt[x]=0;
		dp[x]=0;
		return;
	}
	zt[x]=-1;
	dfs(b[x]);
	if(a[x]>=a[b[x]]+w[b[x]])
	{
		zt[x]=0;
		dp[x]=0;
		return;
	}
	if(a[x]<a[b[x]])
	{
		zt[x]=1;
		dp[x]=1;
		return;
	}
	if(zt[b[x]]==1)
	{
		zt[x]=1;
		dp[x]=dp[b[x]]+1;
	}
	else zt[x]=0,dp[x]=0;
	return;
}
int jc[500005],njc[500005];
int ksm(int n,int k)
{
	int ans=1;
	while(k>=1)
	{
		if(k&1)ans=1LL*ans*n%mod;
		k>>=1;
		n=1LL*n*n%mod; 
	}
	return ans;
}
signed main()
{
	jc[0]=1;
	for(int i=1;i<=500000;i++)jc[i]=1LL*i*jc[i-1]%mod;
	njc[500000]=ksm(jc[500000],mod-2);
	for(int i=499999;i>=0;i--)njc[i]=1LL*(i+1)*njc[i+1]%mod; 
	int t,n;
	t=read();
	for(int greg=1;greg<=t;greg++)
	{
		n=read();
		for(int i=1;i<=n;i++)
		{
			a[i]=read();			
		}
		for(int i=1;i<=n;i++)
		{
			b[i]=read();
		}
		for(int i=1;i<=n;i++)
		{
			w[i]=read();
		}
		for(int i=1;i<=n;i++)
		{
			zt[i]=-2;
			dp[i]=0;
		}
		for(int i=1;i<=n;i++)
		{
			if(zt[i]==-2)dfs(i);
		}
		for(int i=1;i<=n;i++)
		{
			if(zt[i]==0)printf("%lld ",a[i]);
			else printf("%lld ",(a[i]+1LL*w[i]*njc[dp[i]])%mod);
		}
		printf("\n");
	}
	return 0;
}