#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0); cin.tie(0)

using namespace std;

using ll = long long;

#define int ll
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

template <const int MOD>
struct Mint {
	int x;
	Mint(): x(0) {}
	Mint(int _x): x(_x%MOD<0?_x%MOD+MOD:_x%MOD) {}
	void operator+=(Mint rhs) { x+=rhs.x; if(x>=MOD) x-=MOD; }
	void operator-=(Mint rhs) { x-=rhs.x; if(x<0)x+=MOD; }
	void operator*=(Mint rhs) { x*=rhs.x; x%=MOD; }
	void operator/=(Mint rhs) { *this *= rhs.inv(); }
	Mint operator+(Mint rhs) { Mint res=*this; res+=rhs; return res; }
	Mint operator-(Mint rhs) { Mint res=*this; res-=rhs; return res; }
	Mint operator*(Mint rhs) { Mint res=*this; res*=rhs; return res; }
	Mint operator/(Mint rhs) { Mint res=*this; res/=rhs; return res; }
	Mint inv() { return this->pow(MOD-2); }
	Mint pow(int e) {
		Mint res(1);
		for(Mint p=*this;e>0;e/=2,p*=p) if(e%2)
			res*=p;
		return res;
	}
	friend ostream& operator<<(ostream& os, Mint x) {
		return (os << x.x);
	}
};

const int MOD = 1e9+7;
const int MAXN = 5e5+10;

using mint = Mint<MOD>;

void solve() {
	int n; cin>>n;
	vector<int> a(n), b(n), w(n);
	for (int i = 0; i < n; i++) cin>>a[i];
	for (int i = 0; i < n; i++) cin>>b[i];
	for (int i = 0; i < n; i++) cin>>w[i];

	vector<int> in_deg(n);
	for (int i = 0; i < n; i++) in_deg[--b[i]]++;

	queue<int> q;
	for (int i = 0; i < n; i++) {
		if (!in_deg[i]) q.push(i);
	}

	vector<mint> dp(n);
	for (int i = 0; i < n; i++) {
		if (a[i] < a[b[i]]) dp[i] = 1;
	}

	vector<int> topo, sz(n, 1);
	while (q.size()) {
		int u = q.front(); q.pop();
		topo.push_back(u);
		in_deg[b[u]]--;
		if (!in_deg[b[u]]) q.push(b[u]);
	}

	for (int i = 0; i < n; i++) if (in_deg[i]) {
		vector<int> cyc(1, i);
		for (int j = b[i], it = 1; j != i; j = b[j], it++) {
			cyc.push_back(j);
		}
		reverse(all(cyc));

		int st = -1, m = cyc.size();
		for (int i = 0; i < m; i++) {
			if (dp[cyc[i]].x == 1) st = i;
		}
		if (st == -1) continue;

		for (int j = 0; j < m; j++) {
			int cur = cyc[(st+j)%m],
				prv = cyc[(st+j+1)%m];

			in_deg[cur]--;
			if (a[prv] >= a[cur] and a[prv] < a[cur]+w[cur]) {
				sz[prv] = sz[cur] + 1;
				dp[prv] = dp[cur]/sz[prv];
			}
		}
	}

	for (int u: topo) {
		if (a[u] >= a[b[u]] and a[u] < a[b[u]]+w[b[u]]) {
			sz[u] = sz[b[u]] + 1;
			dp[u] = dp[b[u]]/sz[u];
		}
	}

	for (int u = 0; u < n; u++) {
		cout<<(dp[u]*w[u] + a[u])<<' ';
	}
	cout<<'\n';
}

signed main() {
	fastio;
	int tt; cin>>tt;
	while (tt--) {
		solve();
	}
	return 0;
}