// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

const int mod = 1e9 + 7;

int T, n, a[500005], p[500005], w[500005];
int fac[500005], inv[500005];
int ans[500005];
struct graph {
	int tot, hd[500005];
	int nxt[1000005], to[1000005];

	void clear(int n) {tot = 0; memset(hd, 0, sizeof(int) * n); return;}
	void add(int u, int v) {
		nxt[++tot] = hd[u];
		hd[u] = tot;
		to[tot] = v;
		return;
	}
} g;

void solve(int now, int dep, int root) {
	if (dep > 1 && now == root) return;
	if (dep > 1 && (a[now] < a[p[now]] || a[now] >= a[p[now]] + w[p[now]])) return;
	ans[now] = dep > 1 ? inv[dep] % mod : 1;
	for (int i = g.hd[now]; i; i = g.nxt[i]) solve(g.to[i], dep + 1, root);
	return;
}
void solve2(int now) {
	ans[now] = 0;
	for (int i = g.hd[now]; i; i = g.nxt[i])
		if (ans[g.to[i]] == -1 && a[g.to[i]] >= a[now]) solve2(g.to[i]);
}

int main() {
	fac[0] = fac[1] = 1;
	inv[0] = inv[1] = 1;
	for (int i = 2; i <= 500000; i++) {
		fac[i] = (long long)fac[i - 1] * i % mod;
		inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod;
	}
	for (int i = 2; i <= 500000; i++) inv[i] = (long long)inv[i - 1] * inv[i] % mod;
	scanf("%d", &T);
	for (int Case = 1; T--; Case++) {
		scanf("%d", &n);
		g.clear(n + 5);
		for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
		for (int i = 1; i <= n; i++) scanf("%d", &p[i]), g.add(p[i], i);
		for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
		if (Case == 15) printf("%d\n", n);
		for (int i = 1; i <= n; i++) ans[i] = -1;
		for (int i = 1; i <= n; i++)
			if (ans[i] == -1 && (p[i] == i || a[i] >= a[p[i]] + w[p[i]])) {
				ans[i] = 0;
				for (int j = g.hd[i]; j; j = g.nxt[j])
					if (g.to[j] != i && a[g.to[j]] >= a[i]) solve2(g.to[j]);
			} else if (ans[i] == -1 && a[i] < a[p[i]]) solve(i, 1, i);
		for (int i = 1; i <= n; i++)
			if (ans[i] == -1) ans[i] = 1;
		for (int i = 1; i <= n; i++) printf("%lld ", (a[i] + (long long)ans[i] * w[i]) % mod);
		puts("");
	}
	return 0;
}