#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#ifdef LOCAL
template <class T, size_t size = std::tuple_size<T>::value>
std::string to_debug(T, std::string s = "")
    requires(not std::ranges::range<T>);
std::string to_debug(auto x)
    requires requires(std::ostream& os) { os << x; }
{
    return static_cast<std::ostringstream>(std::ostringstream() << x).str();
}
std::string to_debug(std::ranges::range auto x, std::string s = "")
    requires(not std::is_same_v<decltype(x), std::string>)
{
    for (auto xi : x) {
        s += ", " + to_debug(xi);
    }
    return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size>
std::string to_debug(T x, std::string s)
    requires(not std::ranges::range<T>)
{
    [&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
    return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}
#define debug(...) std::cerr << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"
#else
#define debug(x...)
#endif

#define int long long

using i64 = long long;

const int mod = 1e9 + 7;

inline i64 inv(i64 z)
{
    int p = mod - 2;
    i64 ans = 1;
    while (p) {
        if (p & 1)
            ans = (ans * z) % mod;
        z = (z * z) % mod;
        p >>= 1;
    }
    return ans;
}

void solve()
{
#define tests
    auto norm = [&](auto x) {x %= mod; if (x < 0) {x += mod;}; x %= mod; return x; };
    // 64 num;
    // std::cin >> num;
    // std::cout << ((i64)31 * inv(6))%mod;
    int n;
    std::cin >> n;
    std::vector<int> a(n + 1), b(n + 1), wi(n + 1), ans(n + 1, -1);
    std::vector<int> tag(n + 1);
    std::vector<int> rev_to(n + 1);
    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 >> wi[i];
    }

    // make tags
    for (int i = 1; i <= n; i++) {
        if (a[b[i]] > a[i]) {
            tag[i] = 1; // tag 3
            rev_to[b[i]]=i;
            continue;
        } else if (a[b[i]] + wi[b[i]] <= a[i]) {
            tag[i] = 0; // tag 1
            continue;
        }

        else if (a[b[i]] + wi[b[i]] > a[i] ) {
            tag[i] = 2;
            rev_to[b[i]]=i;
        } else if (a[b[i]] + wi[b[i]] <= a[i] and a[b[i]] <= a[i]) {
            tag[i] = 3;
            // rev_to[b[i]] = i;
        }
    }

    // build reverse graph
    // for (int i = 1; i <= n; i++) {
    //     rev_to[b[i]] = i;
    // }

    std::vector<int> fac(n + 1), invfac(n + 1);
    fac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = norm(fac[i - 1] * i);
    }
    invfac[n] = inv(fac[n]);
    for (int i = n - 1; i >= 1; i--) {
        invfac[i] = norm(invfac[i + 1] * (i + 1));
    }

    for (int i = 1; i <= n; i++) {
        if (tag[i] == 0) {
            auto dfs1 = [&](auto self, int pt) -> void {
                ans[pt] = a[pt];
                if (tag[rev_to[pt]] == 3) {
                    tag[rev_to[pt]] = 5;
                    self(self, rev_to[pt]);
                }
            };
            dfs1(dfs1, i);
        } else if (tag[i] == 1) {
            auto dfs2 = [&](auto self, int pt, int dep) -> void {
                ans[pt] = norm(invfac[dep] * norm(a[pt] + wi[pt]));
                ans[pt] = norm(ans[pt] + norm(norm(1 - invfac[dep]) * a[pt]));
                if (tag[rev_to[pt]] == 2) {
                    tag[rev_to[pt]] = 5;
                    self(self, rev_to[pt], dep + 1);
                }
            };
            dfs2(dfs2, i, 1);
        }
    }

    for (int i = 1; i <= n; i++) {
        if (ans[i] == -1) {
            ans[i] = a[i];
        }
        // if (tag[i] == 1) {
        //     ans[i] = norm(a[i] + wi[i]);
        // }
        // if (tag[i] == 0) {
        //     ans[i] = a[i];
        // }
        std::cout << ans[i] << " ";
    }
    std::cout << "\n";
}

signed main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int _ { 1 };
#ifdef tests
    std::cin >> _;
#endif
    while (_--)
        solve();
    return 0;
}