#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

constexpr int N = 1E5 + 5;

int n, m, k;
struct House {
	int x, h, v;
} a[N];

struct Node {
	int sum = 0;
	int pre = 1E9;
} t[N * 4]; 
Node operator+(const Node &lhs, const Node &rhs) {
	return (Node) {
		lhs.sum + rhs.sum,
		std::min(lhs.pre, lhs.sum + rhs.pre)
	} ;
}
void pull(int x) {t[x] = t[x * 2] + t[x * 2 + 1];}
void build(int x, int l, int r) {
	if (l == r) {
		t[x].sum = 0;
		t[x].pre = 0;
		return ;
	}
	int mid = (l + r) / 2;
	build(x * 2, l, mid);
	build(x * 2 + 1, mid + 1, r);
	pull(x);
}
void modify(int x, int l, int r, int p, int v) {
	if (l == r) {
		t[x].sum += v;
		t[x].pre += v;
		return ;
	}
	int mid = (l + r) / 2;
	if (p <= mid) modify(x * 2, l, mid, p, v);
	else modify(x * 2 + 1, mid + 1, r, p, v);
	pull(x);
}
void modify(int p, int v) {
	modify(1, 0, n, p, v);
}
int query() {
	return t[1].pre;
}

void solve() {
	std::cin >> n;

	int elf = 0;

	for (int i = 1; i <= n; ++i) std::cin >> a[i].x;
	for (int i = 1; i <= n; ++i) std::cin >> a[i].h, elf += !a[i].h;
	for (int i = 1; i <= n; ++i) std::cin >> a[i].v;

	build(1, 0, n);

	std::vector<int> ans(n + 1, -1);
	std::multiset<int> vals;

	for (int i = 1, j = 1; i <= n; ++i) {
		if (a[i].h == 0) modify(a[i].v, -1);
		else modify(a[i].v, 1);
		elf -= !a[i].h;
		while (elf == 0 && query() >= 0 && j <= i) {
			if (a[j].h == 0) {
				vals.insert(a[j].v);
			} else {
				modify(a[j].v, -1);
				auto it = vals.lower_bound(a[j].v);
				if (it != vals.end()) {
					modify(*it, 1);
					vals.erase(it);
				}
			}
			++j;
		}
		if (j > 1) ans[i] = a[i].x * 2 - a[j - 1].x;
	}

	for (int i = 1; i <= n; ++i) {
		std::cout << ans[i] << " \n"[i == n];
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;
	std::cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}
/*
1
10
0 1 1 2 32 36 45 45 46 49
1 0 1 1 1 1 1 0 1 1
4 4 7 2 2 8 0 5 6 1
*/