#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
struct segtree {
    int sz;
    vector<int> tree;
    vector<int> add;
    void init(int n) {
        sz = 1;
        while (sz < n)
            sz *= 2;
        tree.assign(sz * 2, {});
        add.assign(sz * 2, {});
    }
    void push(int v) {
        add[v * 2] += add[v];
        add[v * 2 + 1] += add[v];
        add[v] = 0;
    }
    int getv(int v) {
        return tree[v] + add[v];
    }
    void pull(int v) {
        tree[v] = min(getv(v * 2), getv(v * 2 + 1));
    }
    void addseg(int l, int r, int v, int ll, int rr, int x) {
        if (ll >= r or l >= rr) {
            return;
        }
        if (ll <= l and r <= rr) {
            add[v] += x;
            return;
        }
        push(v);
        int m = l + r >> 1;
        addseg(l, m, v * 2, ll, rr, x);
        addseg(m, r, v * 2 + 1, ll, rr, x);
        pull(v);
    }
    void addseg(int l, int r, int x) {
        return addseg(0, sz, 1, l, r, x);
    }
    int getmin() {
        return getv(1);
    }
};
void solve() {
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> h(n);
    vector<int> v(n);
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
        cin >> x[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> h[i];
        h[i] = 1 - h[i];
        cnt += h[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    vector<int> res(n, -1);
    segtree sg;
    sg.init(n + 1);
    int leba = 0;
    multiset<int> emela;
    for (int i = 0; i < n; ++i) {
        if (h[i] == 1)
            sg.addseg(v[i], n + 1, -1);
        else
            sg.addseg(v[i], n + 1, 1);
        cnt -= h[i];
        while (cnt == 0 and sg.getmin() >= 0 and leba <= i) {
            if (h[leba] == 0) {
                sg.addseg(v[leba], n + 1, -1);
                auto it = emela.lower_bound(v[leba]);
                if (it != emela.end()) {
                    sg.addseg(*it, n + 1, 1);
                    emela.erase(it);
                }
            } else {
                emela.insert(v[leba]);
            }
            leba++;
        }
        if (leba != 0) {
         //   cout << leba << endl;
            res[i] = x[i] * 2 - x[leba-1];
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << res[i] << ' ';
    }
    cout << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}