#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr<<#x<<' '<<x<<endl;
typedef pair<int,int>PII;
typedef long long LL;
constexpr int N=500010,mod=1e9+7;
int a[N],b[N],w[N],p[N],d[N];
vector<int>e[N];
int fact[N],infact[N];
int ksm(int a,int b)
{
	int res=1;
	while(b>0)
	{
		if(b&1)res=res*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return res;
}
void dfs(int x)
{
	for(auto y:e[x])
	{
		d[y]=d[x]+1;
		dfs(y);
	}
}
signed main()
{
	//freopen(".in","r",stdin);freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int t;
	fact[0]=1;
	for(int i=1;i<N;i++)fact[i]=fact[i-1]*i%mod;
	infact[N-1]=ksm(fact[N-1],mod-2);
	for(int i=N-2;i>=0;i--)
	infact[i]=infact[i+1]*(i+1)%mod;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)cin>>a[i],e[i].clear(),p[i]=-1,d[i]=0;
		for(int i=1;i<=n;i++)cin>>b[i];
		for(int i=1;i<=n;i++)cin>>w[i];
		vector<int>v;
		for(int i=1;i<=n;i++)
		{
			if(a[i]>=a[b[i]]+w[b[i]])d[i]=0,v.push_back(i);
			else if(a[i]<a[b[i]])d[i]=1,v.push_back(i);
			else e[b[i]].push_back(i);
		}
		for(auto c:v)
		{	
			if(d[c]>0)
			dfs(c);
		}
		vector<int>ans(n+1);
		for(int i=1;i<=n;i++)
		{
			if(p[i]==0)ans[i]=a[i];
			else 
			{
				ans[i]=(a[i]+w[i]*ksm(fact[d[i]],mod-2)%mod)%mod;
			}
			cout<<ans[i]<<' ';
		}
		cout<<endl;
	}

}