#include<bits/stdc++.h>
using namespace std;
#define int long long

//  The 2023 ICPC Asia Hangzhou Regional Contest

constexpr int mod = 1E9 + 7;
const int N = 500005;

int qmi(int a, int b){
    int res = 1;
    while(b){
        if(b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

int fact[N], ifact[N];

void init(int n){
    fact[0] = 1, fact[1] = 1, ifact[1] = 1;
    for(int i = 2;i<=n;i++){
        fact[i] = fact[i - 1] * i % mod;
        ifact[i] = ifact[i - 1] * qmi(i, mod - 2) % mod;
    }
}

void sol(){
    int n; std::cin>>n;
    
    std::vector<int>a(n + 1), b(n + 1), w(n + 1);
    std::vector<int>du(n + 1), ans(n + 1), vis(n + 1);
    std::vector G(n + 1, std::vector<int>(0));

    for(int i = 1;i<=n;i++) std::cin>>a[i];
    for(int i = 1;i<=n;i++) std::cin>>b[i];
    for(int i = 1;i<=n;i++) std::cin>>w[i];
    
    for(int i = 1;i<=n;i++){
        if(i != b[i]){
            if(a[b[i]] > a[i]){
                ans[i] = a[i] + w[i];
                vis[i] = 1;
            }else if(a[i] >= a[b[i]] + w[b[i]]){
                ans[i] = a[i];
                vis[i] = 1;
            }else{
                du[b[i]]++;
                G[i].push_back(b[i]);
            }
        }else{
            vis[i] = 1;
            ans[i] = a[i];
        }
    }

    auto dfs = [&](auto& self, int u)->int{
        vis[u] = 1;
        if(G[u].size() == 0) return 1;
        int kk = self(self, G[u].back()) + 1;
        ans[u] = (ifact[kk] * ((a[u] + w[u])%mod)%mod+ ((1ll - ifact[kk]) * a[u] +mod)%mod)%mod;
        ans[u] = (ans[u] % mod + mod) % mod;
        return kk;
    };

    for(int u = 1;u<=n;u++){
        if(vis[u] || du[u]) continue ;
        dfs(dfs, u);
    }

    for(int i = 1;i<=n;i++){
        std::cout<<ans[i]<<" \n"[i == n];
    }
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    init(N - 1);
    int t = 1; std::cin>>t;
    while(t--) sol();
    return 0;
}