#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
const int N=1e5+10;
struct node{
	int s,mn;
	int l,r;
}tr[N<<2];
void up(int x) {
	tr[x].mn=min(tr[x<<1].mn,tr[x<<1].s+tr[x<<1|1].mn);
	tr[x].s=tr[x<<1].s+tr[x<<1|1].s;
}
void build(int u,int l,int r) {
	tr[u].l=l,tr[u].r=r;
	if(l==r) {
		tr[u].s=tr[u].mn=false;
		return;
	}
	int mid=l+r>>1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
}
void modify(int u,int x,int k) {
	if(tr[u].l==tr[u].r) {
		tr[u].mn+=k;
		tr[u].s+=k;
		return;
	}
	int mid=tr[u].l+tr[u].r>>1;
	if(mid>=x) modify(u<<1,x,k);
	else modify(u<<1|1,x,k);
	up(u);
}
int n;
struct nodes{
	int x,h,v;
}a[N];
multiset<int>s;
int ans[N];
void solve() {
	in(n);
	s.clear();
	rep(i,1,n) in(a[i].x);
	int res=0;
	rep(i,1,n) in(a[i].h),res+=(a[i].h==0);
	rep(i,1,n) in(a[i].v);
	build(1,1,n);
	int j=1;
	rep(i,1,n) {
		modify(1,a[i].v,(a[i].h==0?-1:1));
		res-=(a[i].h==0);
		while(!res&&tr[1].mn>=0&&j<=i) {
			if(a[j].h==0) {
				s.insert(a[j].v);
			}else {
				modify(1,a[j].v,-1);
				if(s.size()&&*s.rbegin()>=a[j].v) {
					auto it=s.lower_bound(a[j].v);
					modify(1,*it,1);
					s.erase(it);
				}
			}
			j++;
		}
		ans[i]=((j!=1)?(2*a[i].x-a[j-1].x):-1);
	}
	rep(i,1,n) cout<<ans[i]<<' ';
	cout<<endl;
}
fire main() {
	in(T);
	while(T--) {
		solve();
	}
	return false;
}