#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

int mod = 1000000007;

struct mint {
    int value = 0;

    constexpr mint() : value() {}

    mint(const long &x) {
        value = normalize(x);
    }

    static long normalize(const long &x) {
        long v = x % mod;
        if (v < 0) v += mod;
        return v;
    }

    bool operator==(const mint &x) { return value == x.value; };

    mint operator+(const mint &x) { return value + x.value; };

    mint operator-(const mint &x) { return value - x.value; };

    mint operator*(const mint &x) { return (long) value * x.value; };

    void operator+=(const mint &x) { value = normalize(value + x.value); };

    void operator-=(const mint &x) { value = normalize(value - x.value); };
};

mint power(mint a, long b) {
    mint res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
        }
        a = a * a;
        b >>= 1;
    }
    return res;
}

mint inv(mint a) {
    return power(a, mod - 2);
}

vector<mint> fact_precalc(1, 1);
vector<mint> inv_fact_precalc(1, 1);

void precalc(int n) {
    fact_precalc.resize(n + 1);
    fact_precalc[0] = 1;
    for (int i = 1; i < fact_precalc.size(); i++) {
        fact_precalc[i] = fact_precalc[i - 1] * i;
    }
    inv_fact_precalc.resize(n + 1);
    inv_fact_precalc[n] = inv(fact_precalc[n]);
    for (int i = n - 1; i >= 0; i--) {
        inv_fact_precalc[i] = inv_fact_precalc[i + 1] * (i + 1);
    }
}

void ensure_fact(int n) {
    while (n >= fact_precalc.size()) {
        fact_precalc.push_back(fact_precalc.back() * fact_precalc.size());
        inv_fact_precalc.push_back(inv(fact_precalc.back()));
    }
}

mint fact(int n) {
    ensure_fact(n);
    return fact_precalc[n];
}

mint inv_fact(int n) {
    ensure_fact(n);
    return inv_fact_precalc[n];
}

mint calc_c(int n, int k) {
    if (n < 0 || k < 0 || k > n) {
        return 0;
    }
    mint res = fact(n);
    res = res * inv_fact(k);
    res = res * inv_fact(n - k);
    return res;
}


struct test {

    int n;
    vector<int> p;
    vector<int> d;

    void dfs(int i) {
        d[i] = -4;
        if (p[i] < 0) {
            d[i] = p[i];
            return;
        }
        int j = p[i];
        if (d[j] == -3) dfs(j);
        if (d[j] == -4) {
            d[i] = -2;
        } else {
            d[i] = d[j] + 1;
        }
    }

    void solve() {
        cin >> n;
        vector<int> a(n), b(n), w(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        for (int i = 0; i < n; i++) cin >> b[i], b[i]--;
        for (int i = 0; i < n; i++) cin >> w[i];

        p.resize(n);
        for (int i = 0; i < n; i++) {
            if (a[i] < a[b[i]]) {
                p[i] = -1;
            } else if (a[i] < a[b[i]] + w[b[i]]) {
                p[i] = b[i];
            } else {
                p[i] = -2;
            }
        }
        d.assign(n, -3);
        for (int i = 0; i < n; i++) {
            if (d[i] == -3) dfs(i);
        }

        for (int i = 0; i < n; i++) {
            if (d[i] == -2) {
                cout << mint(a[i]).value << " ";
            } else {
                cout << (mint(a[i]) + mint(w[i]) * inv_fact(d[i] + 2)).value << " ";
            }
        }
        cout << "\n";
    }
};

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        test().solve();
    }

    return 0;
}