#include <bits/stdc++.h>

void solve() {
    int n;
    std::cin >> n;
    std::vector<int> x(n), h(n), v(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> h[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> v[i];
    }

    int it = h.rend() - std::find(h.rbegin(), h.rend(), 0) - 1;
    if (it == -1) {
        assert(false);
        for (int i = 0; i < n; i++) {
            std::cout << x[i] << " \n"[i == n - 1];
        }
        return;
    }

    std::vector<int> ans(n, -1);
    std::vector<int> cum;
    std::vector<int> fuck;
    for (int i = 0; i <= it; i++) {
        if (h[i] == 0) {
            cum.push_back(v[i]);
        } else {
            fuck.push_back(v[i]);
        }
    }
    std::sort(fuck.begin(), fuck.end());
    std::sort(cum.begin(), cum.end());

    // assert(fuck.size() >= cum.size());
    // fuck.resize(cum.size());

    int x_left = -1;
    int left = 0;
    for (int i = 0; i < it; i++) {
        std::cout << "-1\n";
    }
    for (int i = it; i < n; i++) {
        if (i != it) {
            assert(h[i] == 1);
            auto it = std::lower_bound(fuck.begin(), fuck.end(), v[i]);
            fuck.insert(it, v[i]);
            // fuck.resize(cum.size());
        }

        if (x_left != left && fuck.size() >= cum.size()) {
            bool pos = true;
            for (int i = 0; i < cum.size(); i++) {
                pos = pos && fuck[i] <= cum[i];
            }
            if (pos) {
                x_left = left;
            }
        }
        while (x_left == left && fuck.size() >= cum.size() && left < i) {
            if (h[left] == 0) {
                left++;
                x_left++;
                continue;
            }
            int val_ch = v[left];
            auto it = std::lower_bound(fuck.begin(), fuck.end(), val_ch);
            fuck.erase(it);
            left++;

            std::pair<int, int> min(1.1e9, -1);
            for (int i = 0; i < left; i++) {
                if (h[i] == 0 && v[i] >= val_ch) {
                    min = std::min(min, {v[i], i});
                }
            }
            if (min.second == -1) {
                if (fuck.size() >= cum.size()) {
                    bool pos = true;
                    for (int i = 0; i < cum.size(); i++) {
                        pos = pos && fuck[i] <= cum[i];
                    }
                    if (pos) {
                        x_left = left;
                        continue;
                    }
                }
                break;
            } else {
                v[min.second] = -1;
                auto it = std::lower_bound(cum.begin(), cum.end(), min.first);
                cum.erase(it);
                x_left = left;
            }
        }

        if (x_left != -1) {
            ans[i] = x[i] * 2 - x[x_left];
        }
    }
    for (int i = 0; i < n; i++) {
        std::cout << ans[i] << " \n"[i == n - 1];
    }
}

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}