#include<cstdio>
#include<bitset>
#include<cstring>
using namespace std;
typedef long long ll;
const int N = 5e5+10;
const ll mod = 1e9 + 7;
ll a[N] , b[N] , w[N] ,E[N] ,  n , T , inv2 , fac[N];
int h[N << 1] , nxt[N << 1] , to[N << 1] , tot , dep[N];
int tmp[N] , idx;
bitset<N> vis , st;
ll qmi(ll x,ll q)
{
    ll res = 1;
    while(q){
        if(q & 1) res = res * x % mod;
        x = x * x % mod;
        q >>= 1ll;
    }
    return res;
}
void add(int u,int v)
{
    nxt[++tot] = h[u] , to[tot] = v , h[u] = tot;
}
void dfs(int u,int fa)
{
    if(st[u]) return ;
    if(dep[fa]) dep[u] = dep[fa] + 1;
    else dep[u] = -1;
    E[u] = (a[u] + (~dep[u] ? qmi(fac[dep[u]],mod-2) : 0) * w[u] % mod) % mod;
    st.set(u);
   // printf("%d %d du%d dfa = %d E=%d\n",u,fa,dep[u],dep[fa],E[u]);
    for(int i=h[u];i;i=nxt[i]){
        int v = to[i];
        dfs(v,u);
    }
    return ;
}
int main()
{
    scanf("%d",&T);
    fac[1] = 1;
    for(int i=2;i<N;i++)
        fac[i] = (fac[i-1] * (ll)i) % mod;
    while(T--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&b[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&w[i]);

        for(int cur=1;cur<=n;cur++){
            if(b[cur] == cur) dep[cur] = -1 , E[cur] = a[cur] , st[cur] = 1;
            if(a[cur] >= a[b[cur]]+w[b[cur]])  dep[cur] = -1 , E[cur] = a[cur] , st[cur] = 1;
            else if(a[cur] < a[b[cur]]) dep[cur] = 1 , E[cur] = a[cur] + w[cur] , st[cur] = 1;
            add(b[cur],cur);
        }
        for(int u=1;u<=n;u++){
            for(int i=h[u];i;i=nxt[i]){
                int v = to[i];
              //  printf("du = %d dv = %d\n",dep[u],dep[v]);
                if(dep[u] == 1 || dep[u] == -1)
                    dfs(v,u);
            }
        }
        for(int i=1;i<=n;i++) 
            printf("%d ",E[i]);
        puts("");
        tot = 0;
        memset(h,0,sizeof(int) * (n + 1));
        memset(dep,0,sizeof(int) * (n + 1));
        for(int i=1;i<=n;i++)
            st.reset(i) , vis.reset(i);
    }
    return 0;
}