#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;


ll qsm(ll x, ll n) {
    ll res = 1;
    while (n) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll inv(ll a) { return qsm(a, mod - 2); }

ll fac[500003];

void solve() {
    ll n;cin >> n;
    vector<ll> a(n + 1), b(n + 1), w(n + 1), ans(n + 1);
    for (ll i = 1; i <= n; i++) cin >> a[i];
    for (ll i = 1; i <= n; i++) cin >> b[i];
    for (ll i = 1; i <= n; i++) cin >> w[i];
    vector<vector<ll>> g(n + 1);
    for (ll i = 1; i <= n; i++) {
        if (a[i] < a[b[i]]) ans[i] = a[i] + w[i];
        else if (a[i] >= a[b[i]] + w[b[i]]) ans[i] = a[i];
        else if (i == b[i]) ans[i] = a[i];
        else {
            g[i].push_back(b[i]);
            //cout << i << " ->" << b[i] << endl;
        }
    }
    vector<ll> sz(n + 1, 1);
    auto dfs = [&](ll u, auto&& dfs) {
        if (g[u].size() == 0) return;
        for (auto i : g[u]) {
            //cout << u << "---" << i << endl;
            dfs(i, dfs);
            sz[u] = sz[i] + 1;
            //ans[u] = 1/sz[u]! * (a[u] + w[u]) + (1 - 1/sz[u]!) * a[u];
            //cout << u << ' ' << sz[u] << ' ' << fac[sz[u]] << endl;  
            //cout << a[u] << endl;
            if (a[i] <= a[u] && a[i] + w[i] > a[u])
                ans[u] = (inv(fac[sz[u]]) * (a[u] + w[u]) % mod + ((fac[sz[u]] - 1 + mod) % mod * a[u]) % mod * inv(fac[sz[u]]) % mod) % mod;
            else ans[u] = a[u];
        }
        };

    for (ll i = 1; i <= n; i++) {
        if (!ans[i]) dfs(i, dfs);
        cout << ans[i] << ' ';
    }
    cout << endl;

}

int main() {
    fac[1] = 1;
    for (ll i = 2; i <= 500000; i++) fac[i] = fac[i - 1] * i % mod;
    ll t;cin >> t;
    while (t--) solve();
}