#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 mod = 1000000007;
i64 qpow(i64 x, i64 p) {
	i64 ans = 1;
	while ( p ) {
		if ( p&1 ) ans *= x;
		p >>= 1;
		x *= x;
		x %= mod;
		ans %= mod;
	}
	return ans%mod;
}
i64 inv(i64 x) {
	return qpow(x,mod-2);
}
void solve() {
	int n;
	cin >> n;
	vector<int>a(n),b(n),w(n),num(n),vis(n);
	for ( auto &i : a ) cin >> i;
	for ( auto &i : b ) {
		cin >> i;
		i--;
	}
	for ( auto &i : w ) cin >> i;
	vector<pair<i64,i64>>p(n);
	vector g(n,vector<int>(0));
	for ( int i = 0 ; i < n ; i++ ) {
		if( b[i] != i ) {
			if ( a[i] < a[b[i]] ) {
				vis[i] = 1;
			} else if ( a[i] < a[b[i]]+w[b[i]] ){	
				g[b[i]].emplace_back(i);
				num[i]++;	
			}
		}
	}
	queue<pair<int,int>>q;
	for ( int i = 0 ; i < n ; i++ ) {
		if ( num[i] == 0 ) {
			q.emplace(i,1);
			if(!vis[i]) p[i] = {1,0};
			else p[i] = {0,1};
		}
	}
	vector<int>sum(n+1);
	sum[0] = 1;
	for ( int i = 1 ; i <= n ; i++ ) {
		sum[i] = (i+1)*(sum[i-1]);
		sum[i] %= mod;
	} 
	while ( q.size() ) {
		auto [u,cnt] = q.front();
		q.pop();
		vis[u] = 1;
		for ( auto v : g[u] ) {
			num[v]--;
			if ( a[u] >= a[v] ) {
				p[v].first += p[u].first;
			}
			p[v].first %= mod;
			p[v].second %= mod;
			if ( b[u] != u && a[u]+w[u] > a[v] ) {
				i64 t = inv(sum[cnt]);
				p[v].second += t%mod;
				p[v].first += t%mod*(sum[cnt]-1)%mod;
			} else {
				p[v].first += p[u].second%mod;
			}
			p[v].first %= mod;
			p[v].second %= mod;
			if ( num[v] == 0 ) q.emplace(v,cnt+1);
		}
		
	}
	for ( int i = 0 ; i < n ; i++ ) {
		if ( !vis[i] ) cout << a[i] << " \n"[i == n-1];
		else cout << (a[i]*p[i].first%mod+(a[i]+w[i])*p[i].second%mod)%mod << " \n"[i == n-1];
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while ( T-- ) {
		solve();
	}
}