#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5 + 10, LOGN = log2(MAXN) + 1, inf = ~0U >> 2, INF = ~0U >> 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
	template <typename T> il bool read(T &x) {
		x = 0; bool f = false; char ch;
 		while (!isdigit(ch = getchar())) {
			f ^= !(ch ^ '-');
			if (ch == EOF) return false;
		}
		while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
		if (f) x = ~x + 1; return true;
	}
	il int read() {int x; read(x); return x;}

	template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}

	template <typename T> il void gmin(T &x, T y) {x = x < y ? x : y;}

 	template <typename T> il void gmax(T &x, T y) {x = x > y ? x : y;}

	template <typename T, typename ...L>
	il bool read(T &x, L &...y) {return read(x) && read(y...);}

	template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, a[MAXN], b[MAXN], w[MAXN], vis[MAXN], sk[MAXN], d[MAXN], ind[MAXN], cnt[MAXN]; ll prob[MAXN];
ll fac[MAXN], inv[MAXN];
const int mod = 1e9 + 7;

il int qpow(ll a, int b) {
	ll ans = 1;
	while (b) {
		if (b & 1) (ans *= a) %= mod;
		(a *= a) %= mod; b >>= 1;
	} return ans;
}

il int dp(int x) {
	if (cnt[x]) return d[x];
	++cnt[x];
	if (~sk[x]) return d[x] = 1;
	dp(b[x]);
	return d[x] = d[b[x]] ? d[b[x]] + 1 : 0;
}

il void solve() {
	read(n); rer(i, 1, n, a); rer(i, 1, n, b); rer(i, 1, n, w);
	rep1(i, 1, n) vis[i] = 1, sk[i] = -1, ind[i] = cnt[i] = d[i] = 0;
	rep1(i, 1, n) {
		if (a[i] < a[b[i]]) sk[i] = 1;
		else if (a[i] >= a[b[i]] + w[b[i]]) sk[i] = 0;
		++ind[b[i]];
	} queue <int> q;
	rep1(i, 1, n) if (!ind[i]) q.emplace(i);
	while (q.size()) {
		int x = q.front(); q.pop();
		vis[x] = 0;
		if (!--ind[b[x]]) q.emplace(b[x]);
	}
//	rep1(i, 1, n) cout << vis[i]; puts("");
	rep1(i, 1, n) if (vis[i]) dp(i);
	rep1(i, 1, n) prob[i] = ~sk[i] ? sk[i] : inv[d[i]];
	rep1(i, 1, n) printf("%lld ", (prob[i] * (a[i] + w[i]) + (1 + mod - prob[i]) * a[i]) % mod); puts("");
}

int main() {
	fac[0] = 1;
	rep1(i, 1, 5e5) fac[i] = fac[i - 1] * i % mod;
	inv[MAXN - 10] = qpow(fac[MAXN - 10], mod - 2);
	rep2(i, MAXN - 11, 1) inv[i] = inv[i + 1] * (i + 1) % mod;
	for (int T = read(); T--; ) solve();
	return 0;
}