#include <iostream>
#include <algorithm>
#include <set>
#include <cstring>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10;

int n, m, d[MAXN], tp[MAXN], val[MAXN], res[MAXN];
multiset <int> st;

int tr[MAXN << 2], lz[MAXN << 2];
inline void Pushdown(int cur)
{
    if (!lz[cur]) return;
    tr[cur << 1] += lz[cur], lz[cur << 1] += lz[cur];
    tr[cur << 1 | 1] += lz[cur], lz[cur << 1 | 1] += lz[cur];
    lz[cur] = 0;
}
void Update(int cur, int l, int r, int x, int y, int k)
{
    if (x <= l && r <= y) tr[cur] += k, lz[cur] += k;
    else
    {
        Pushdown(cur);
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x, y, k);
        if (y > mid) Update(cur << 1 | 1, mid + 1, r, x, y, k);
        tr[cur] = min(tr[cur << 1], tr[cur << 1 | 1]);
    }
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    Read(T);
    while (T--)
    {
        Read(n), m = 0;
        for (int i = 1; i <= n; i++) Read(d[i]);
        for (int i = 1; i <= n; i++) Read(tp[i]), m += (tp[i] == 0);
        for (int i = 1; i <= n; i++) Read(val[i]);
        st.clear();
        memset(tr, 0, sizeof(tr)), memset(lz, 0, sizeof(lz));
        int l = 1; bool flag = 0;
        for (int i = 1; i <= n; i++)
        {
            if (tp[i] == 0) Update(1, 0, n, val[i], n, -1);
            else Update(1, 0, n, val[i], n, 1);
            m -= (tp[i] == 0);
            if (m == 0)
            {
                while (l <= i && tr[1] >= 0)
                {
                    flag = 1;
                    if (tp[l] == 1)
                    {
                        Update(1, 0, n, val[l], n, -1);
                        auto it = st.lower_bound(val[l]);
                        if (it != st.end()) Update(1, 0, n, *it, n, 1), st.erase(it);
                    }
                    else st.insert(val[l]);
                    l++;
                }
                if (flag) res[i] = 2 * d[i] - d[l - 1];
                else res[i] = -1;
            }
            else res[i] = -1;
        }
        for (int i = 1; i <= n; i++) cout << res[i] << ' ';
        cout << '\n';
    }
    return 0;
}