#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")

namespace yzqwq{
    il int read(){
        int x=0,f=1;char ch=gc;
        while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
        while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
        return x*f;
    }
    il int qmi(int a,int b,int p){
        int ans=1;
        while(b){
            if(b&1) ans=ans*a%p;
            a=a*a%p,b>>=1;
        }
        return ans;
    }
    il int gcd(int a,int b){
        if(!b) return a;
        return gcd(b,a%b);
    }
    il int lcm(int a,int b){
        return a/gcd(a,b)*b;
    }
    il void exgcd(int a,int b,int &x,int &y){
        if(!b) return x=1,y=0,void(0);
        exgcd(b,a%b,x,y);
        int t=x;
        x=y,y=t-a/b*x;
        return ;
    }
    il int F(int n,int a,int b,int c){
        //sum{|_ (ai+b)/c _| i:0~n}
        if(!n) return b/c;
        if(!a) return (n+1)*(b/c);
        if(a>=c||b>=c){
            int x=a/b,y=b/c;
            return n*(n+1)/2*x+(n+1)*y+F(n,a%c,b%c,c);
        }
        int m=(a*n+b)/c;
        return n*m+F(m-1,c,c-b+1,a);
    }
    struct lb{
        int d[64];
        il void print(){
            for(re int i=0;i<63;++i)
            if(d[i]) printf("%lld:%lld\n",i,d[i]);
            return ;
        }
        lb(){memset(d,0,sizeof(d));}
        il void operator +=(int x){
            for(re int i=62;i>=0;--i){
                if(!(x&(1ll<<i))) continue;
                if(d[i]) x^=d[i];
                else return d[i]=x,void(0);
            }
            return ;
        }
        int& operator [](int x){
            return d[x];
        }
        il void operator +=(lb &x){
            for(re int i=62;i>=0;--i)
            if(x[i]) *this+=x[i];
            return ;
        }
        il friend lb operator +(lb &x,lb &y){
            lb z=x;
            for(re int i=62;i>=0;--i)
            if(y[i]) z+=y[i];
            return z;
        }
        il int Max_calc(){
            int ans=0;
            for(re int i=62;i>=0;--i)
            if((ans^d[i])>ans) ans^=d[i];
            return ans;
        }
    };
    mt19937 rnd(time(0));
}
using namespace yzqwq;
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)

const int N=1e5+10,inf=1e18;
int n,m,k;
struct node{
	int x,h,v;
}a[N];
struct Tree{
	int l,r,s,mi;
}tr[N<<2];
int ans[N];
multiset<int> st;

il void up(int u){
	tr[u].mi=min(tr[ls(u)].mi,tr[ls(u)].s+tr[rs(u)].mi);
	tr[u].s=tr[ls(u)].s+tr[rs(u)].s;
}
il void build(int u,int l,int r){
	tr[u].l=l,tr[u].r=r,tr[u].mi=inf,tr[u].s=0;
	if(l==r) return tr[u].s=tr[u].mi=0,void(0);
	int mid=l+r>>1;
	build(ls(u),l,mid),build(rs(u),mid+1,r);
	return up(u),void(0);
}
il void modify(int u,int x,int k){
	if(tr[u].l==tr[u].r){
		tr[u].s+=k,tr[u].mi+=k;
		return ;
	}
	int mid=tr[u].l+tr[u].r>>1;
	if(x<=mid) modify(ls(u),x,k);
	else modify(rs(u),x,k);
	return up(u),void(0); 
}

il void solve(){
	n=rd,st.clear();
	int F=0;
	for(re int i=1;i<=n;++i) a[i].x=rd,ans[i]=0;
	for(re int i=1;i<=n;++i) a[i].h=rd;
	for(re int i=1;i<=n;++i) a[i].v=rd;
	for(re int i=1;i<=n;++i) F+=(a[i].h==0);
	build(1,0,n);
	for(re int i=1,j=1;i<=n;++i){
		if(a[i].h==0) modify(1,a[i].v,-1);
		else modify(1,a[i].v,+1);
		F-=(a[i].h==0);
		while(!F&&tr[1].mi>=0&&j<=i){
			if(!a[j].h) st.insert(a[j].v);
			else{
				modify(1,a[j].v,-1);
				auto x=st.lower_bound(a[j].v);
				if(st.end()!=x){
					int K=(*x);
					st.erase(x);
					modify(1,K,1);
				}
			}++j;
		}
		if(j!=1) ans[i]=-a[j-1].x+2*a[i].x;
	}	 
	for(re int i=1;i<=n;++i) printf("%lld ",ans[i]==0?-1:ans[i]);puts("");
	return ;
}

signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    int t=rd;while(t--)
    solve();
    return 0;
}