#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back

#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ff first
#define ss second
#define fori(x,y) for(int i=x;i<=(int)(y);++i)
#define forj(x,y) for(int j=x;j<=(int)(y);++j)
#define fork(x,y) for(int k=x;k<=(int)(y);++k)

#define debug(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll MOD = 1e9+7;
ll qpow(ll a,ll p) {ll res=1; while(p) {if (p&1) {res=res*a%MOD;} a=a*a%MOD; p>>=1;} return res;}


const int N = 5e5+7;
ll fact[N], inv[N];  // 阶乘逆元

ll a[N], b[N], w[N];
vector<int> g[N];
ll res[N];
void solve() {
	int n;
    cin >> n;
    fori(1, n) {
        g[i].clear();
        res[i] = -1;
    }
    fori(1, n) cin >> a[i];
    fori(1, n) {
        cin >> b[i];
        g[b[i]].push_back(i);
    }
    fori(1, n) cin >> w[i];

    deque<pii> que;
    fori(1, n) {
        if (a[b[i]]<=a[i]&&a[i]<a[b[i]]+w[b[i]]) continue;
        if (a[b[i]]>a[i]) res[i] = (a[i]+w[i])%MOD;
        else res[i] = a[i];
        for (auto v: g[i]) que.push_back({v, 2});
    }
    while (que.size()) {
        auto pi = que.front();
        que.pop_front();
        int u = pi.first;
        if (res[u] != -1) continue;
        res[u] = (a[u]*fact[pi.second]+w[u])%MOD*inv[pi.second]%MOD;
        for (auto v: g[u]) {
            if (res[v] != -1) continue;
            que.push_back({v, pi.second+1});
        }
    }
    fori(1, n) if (res[i] == -1) res[i] = a[i];

    fori(1, n) cout << res[i]%MOD << " ";
    cout << endl;
}

signed main() {
	IOS;
    fact[0] = inv[0] = 1;
    fori(1, N-1) fact[i] = fact[i-1]*i%MOD;
    fori(1, N-1) inv[i] = qpow(fact[i], MOD-2)%MOD;
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}