#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=500010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int t, n;
ll a[N], b[N], w[N], bio[N], d[N];
ll fact[N], finv[N];

int add (int x, int y) {
	x += y;
	if (x >= MOD) return x - MOD;
	return x;
}

int sub (int x, int y) {
	x -= y;
	if (x < 0) return x + MOD;
	return x;
}

int mul (int x, int y) {
	return (ll) x * y % MOD;
}

int pot (int x, int e) {
	if (e == 0) return 1;
	if (e == 1) return x;
	int res = pot(x, e / 2);
	res = mul(res, res);
	if (e % 2 == 1) res = mul(res, x);
	return res;
}

int inv (int x) {
	return pot(x, MOD - 2);
}

void precompute () {
	fact[0] = finv[0] = 1;
	for (int i = 1; i < N; i++) {
		fact[i] = mul(i, fact[i - 1]);
		finv[i] = inv(fact[i]);
	}
}

int calc (int x) {
	if (d[x] != -1) return d[x];
	bio[x] = 1;
	if (a[x] >= a[b[x]] + w[b[x]]) {
		bio[x] = 2;
		d[x] = 0;
		return 0;
	} else if (a[x] < a[b[x]]) {
		bio[x] = 2;
		d[x] = 1;
		return 1;
	} else if (bio[b[x]] == 1) {
		bio[x] = 2;
		d[x] = 0;
		return 0;
	}
	int res = 1 + calc(b[x]);
	bio[x] = 2;
	d[x] = res;
	return res;
}

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	precompute();
	cin >> t;
	while (t--) {
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			bio[i] = 0;
			d[i] = -1;
		}
		for (int i = 1; i <= n; i++) {
			cin >> b[i];
		}
		for (int i = 1; i <= n; i++) {
			cin >> w[i];
		}
		for (int i = 1; i <= n; i++) {
			int k = calc(i);
			int sol;
			if (k == 0) {
				sol = a[i];
			} else {
				sol = add(mul(finv[k], add(a[i], w[i])), mul(sub(1, finv[k]), a[i]));
			}
			cout << sol << " ";
		}
		cout << '\n';
	}
	return 0;
}