#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';


const ll MOD = 1000000007;
ll modExp(ll base, ll power) {
    if (power == 0) {
        return 1;
    } else {
        ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
        if (power % 2 == 1) cur = cur * base;
        cur = cur % MOD;
        return cur;
    }
}

const int MX = 500001;
int ans[MX];
vector<vi> graph;
ll A[MX], B[MX], W[MX];
ll facs[MX], facInvs[MX];

void dfs(int v, int d) {
    ans[v] += W[v] * facInvs[d];
    ans[v] %= MOD;
    trav(a, graph[v]) {
        dfs(a, d+1);
    }
}

void solve() {

    int N; cin >> N;
    F0R(i, N) cin >> A[i];
    F0R(i, N) cin >> B[i];
    F0R(i, N) B[i]--;
    F0R(i, N) cin >> W[i];
    vi rts;
    graph = vector<vi>(N);
    F0R(i, N) {
        if (A[i] < A[B[i]]) {
            rts.pb(i);
        } else if (A[i] < A[B[i]] + W[B[i]]) {
            graph[B[i]].pb(i);
        }
    }

    F0R(i, N) {
        ans[i] = A[i];
    }
    trav(a, rts) {
        dfs(a, 1);
    }
    F0R(i, N) {
        cout << ans[i] << " ";
    }
    cout << nl;


}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
    facs[0] = 1;
    FOR(i, 1, MX) facs[i] = (facs[i-1]*i)%MOD;
    F0R(i, MX) facInvs[i] = modExp(facs[i], MOD-2);

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