#include <bits/stdc++.h>

using namespace std;
#define int long long
int seg[96069*4],lazy[96069*4];
void build(int p,int l,int r){
    seg[p] = lazy[p] = 0;
    if(l==r){
        return ;
    }
    int md = (l+r)/2;
    build(p*2,l,md);
    build(p*2+1,md+1,r);
}
void prop(int p,int l,int r){
    seg[p]+=lazy[p];
    if(l!=r){
        lazy[p*2]+=lazy[p];
        lazy[p*2+1]+=lazy[p];
    }
    lazy[p] = 0;
}
void update(int p,int l,int r,int lq,int rq,int val){
    prop(p,l,r);
    if(l>=lq&&r<=rq){
        lazy[p] = val;
        prop(p,l,r);
        return ;
    }
    if(r<lq||l>rq)return ;
    int md = (l+r)/2;
    update(p*2,l,md,lq,rq,val);
    update(p*2+1,md+1,r,lq,rq,val);
    seg[p] = min(seg[p*2],seg[p*2+1]);
}
multiset<int> co,vl,lo;
bool check(){
    if(co.size()<vl.size()){
        return 0;
    }
    auto it = vl.begin();
    for(auto i:co){
        if(it==vl.end())break;
        if((*it)<i){
            return 0;
        }
        it++;
    }
    return 1;
}
signed main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int x[n],l[n],c[n],lol = -1;
        co.clear();vl.clear();lo.clear();
        map<int,int> sav;set<int> mp;
        int cnt= 0;
        for(int i = 0;i<n;i++){
            cin>>x[i];
        }
        for(int i = 0;i<n;i++){
            cin>>l[i];
            if(!l[i])lol = i;
        }
        for(int i = 0;i<n;i++){
            cin>>c[i];
            mp.insert(c[i]);
        }
        for(auto i:mp){
            sav[i] = ++cnt;
        }
        build(1,1,cnt);
        int le = 0;
        for(int i = 0;i<n;i++){
            if(l[i]){
                co.insert(c[i]);
                update(1,1,cnt,sav[c[i]],cnt,1);
            }else{
                vl.insert(c[i]);
                update(1,1,cnt,sav[c[i]],cnt,-1);
            }
            if(i<lol){
                cout<<-1<<" ";
                continue;
            }
            while(le<=i&&seg[1]>=0){
                if(l[le]==0)lo.insert(c[le]);
                else{
                    auto it = lo.lower_bound(c[le]);
                    if(it!=lo.end()){
                        auto xd = vl.lower_bound((*it));
                        vl.erase(xd);
                        update(1,1,cnt,sav[*xd],cnt,1);
                        lo.erase(it);
                    }
                }
                if(l[le]){
                    co.erase(co.lower_bound(c[le]));
                    update(1,1,cnt,sav[c[le]],cnt,-1);
                }
                le++;
            }
            if(le==0)cout<<-1<<" ";
            else cout<<x[i]+x[i]-x[le-1]<<" ";
        }
        cout<<endl;
    }
    return 0;
}