#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<deque>
#include<cctype>
#include<string.h>
#include<math.h>
#include<time.h>
#include<random>
#include<stack>
#include<string>
#define lowbit(x) (x & -x)
using namespace std;
mt19937 rnd(time(0));
typedef long long ll;
const ll mod=1e9+7;
const ll N=2e5+5;
ll ksm(ll x,ll y)
{
	ll ans=1;
	while(y)
	{
		if(y&1)
		ans=(ans%mod*x%mod)%mod;
		x=x%mod*(x%mod)%mod;
		y>>=1;
	}
	return ans%mod%mod;
}
ll p1=ksm(2,mod-2);
ll gcd(ll x,ll y)
{
	if(y==0)
	return x;
	else 
	return gcd(y,x%y);
}
void fio()
{
		ios::sync_with_stdio(0);
		cin.tie(0);
		cout.tie(0);
}
ll query(ll l,ll r)
{
	cout<<"?"<<" "<<l<<" "<<r<<endl;
	cout.flush();
	ll x;
	cin>>x;
	return x;
}
struct s
{
	ll x,y,w;
}p[550000];
vector<ll>g[555000];
bool vi[550000];
ll ans[552000];
ll in[550000];
ll op[555000];
ll cs=0;
ll ou[550000];
ll dfs(ll x,ll sd)
{
	if(vi[x])
	{
		cs=ou[x];
	return (op[x]*ksm(ou[x],mod-2)%mod)%mod;
	}
	vi[x]=1;
	ll cnt=0;
	for(auto j:g[x])
	{
		op[x]=dfs(j,sd+1);
	}
	if(cs>0)cs++;
	ll ok=ksm(cs,mod-2);
	op[x]=(op[x]%mod*ok%mod)%mod;
	ou[x]=cs;
	ans[x]=(((p[x].x+p[x].w)%mod)*op[x]%mod)+(((1-op[x]+1000*mod)%mod)*(p[x].x)%mod)%mod;
	ans[x]%=mod;
	return op[x];
}
int main()
{
	fio();
	ll t;
	cin>>t;
	while(t--)
	{
		ll n;
		cin>>n;
		for(ll i=1;i<=n;i++)cin>>p[i].x,g[i].clear();
		for(ll i=1;i<=n;i++)cin>>p[i].y,vi[i]=0,in[i]=0,ou[i]=0;
		for(ll i=1;i<=n;i++)cin>>p[i].w,op[i]=0;
		for(ll i=1;i<=n;i++)
		{
			in[p[i].y]++;
			if(p[i].y==i)
			{
				ans[i]=p[i].x;
				vi[i]=1;
				op[i]=0;
				in[p[i].y]--;
				ou[i]=1;
			}
			else if(p[i].x<p[p[i].y].x)
			{
				vi[i]=1;
				ans[i]=(p[i].x+p[i].w)%mod;
				op[i]=1;
				in[p[i].y]--;
				ou[i]=1;
			}
			else if(p[i].x>=p[p[i].y].x+p[p[i].y].w)
			{
				vi[i]=1;
				ans[i]=p[i].x;
				op[i]=0;
				in[p[i].y]--;
				ou[i]=1;
			}
			else 
			g[i].push_back(p[i].y);
			//if(vi[i])cout<<ans[i]<<endl;
		}
		for(ll i=1;i<=n;i++)
		{
			if(in[i]==0&&vi[i]==0)
			{
				ll u=dfs(i,1);
			}
		}
		for(ll i=1;i<=n;i++)
		{
			cout<<ans[i]%mod<<" ";
		}
		cout<<endl;
	}
}