#include <bits/stdc++.h>
using i64 = long long;
constexpr i64 P = 1E9 + 7;

i64 qpow(i64 a, i64 b) {
	i64 res = 1;
	while(b) {
		if(b & 1) {
			res = res * a % P;
		}
		a = a * a % P;
		b >>= 1;
	}
	return res;
}

void solve() {
	
	int n;
	std::cin >> n;
	std::vector<i64> a(n + 1), b(n + 1), w(n + 1);
	for(int i = 1; i <= n; ++i) {
		std::cin >> a[i];
	}
	for(int i = 1; i <= n; ++i) {
		std::cin >> b[i];
	}
	for(int i = 1; i <= n; ++i) {
		std::cin >> w[i];
	}
	std::vector<i64> ans(n + 1), d(n + 1), fac(n + 1, 1);
	std::vector<std::vector<int>> v(n + 1);
	for(int i = 1; i <= n; ++i) {
		fac[i] = fac[i - 1] * i % P;
		if(a[b[i]] + w[b[i]] <= a[i] || b[i] == i) {
			ans[i] = a[i];
		} else if(a[b[i]] > a[i]) {
			ans[i] = (a[i] + w[i]) % P;
		} else {
			v[b[i]].push_back(i);
			d[i]++;
		}
	}
	auto dfs = [&](auto self, int id, int dep) ->void {
		ans[id] = ((a[id] + w[id]) + a[id] * (fac[dep] - 1)) % P * qpow(fac[dep], P - 2) % P;
		for(auto nxt : v[id]) {
			self(self, nxt, dep + 1);
		}
	};
	for(int i = 1; i <= n; ++i) {
		if(v[i].size() && d[i] == 0) {
			for(auto nxt : v[i]) {
				if(ans[i] > a[nxt]) {
					dfs(dfs, nxt, 2);
				}
			}
		}
	}
	for(int i = 1; i <= n; ++i) {
		ans[i] = (ans[i] == 0 ? a[i] : ans[i]);
		std::cout << ans[i] % P << " \n"[i == n];
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int T;
	std::cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}