#include <bits/stdc++.h>
#define ll long long
#define ii pair <int, int>
#define F first
#define S second
#define pb push_back

using namespace std;

const int N = 2e5 + 5;
const int mod = 1e9 + 7;

int n, a[N], b[N];

void solve(){
    cin >> n;
    ll ans = 0;
    int mx = 0;
    set <ii> s;
    s.insert(ii(-2e9, -2e9));
    s.insert(ii(2e9, 2e9));
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    for (int i = 1; i <= n; ++ i){
        cin >> b[i];
        ans += (a[i] - b[i]);

        int l = b[i], r = a[i];

        ii st = *(--s.upper_bound(ii(b[i], b[i])));
        if (st.S >= b[i]){
            l = min(l, st.F);
            s.erase(s.lower_bound(st));
            r = max(r, st.S);
        }

        while (true){
            ii ed = *s.lower_bound(ii(b[i], b[i]));
            if (ed.F > a[i]) break;
            r = max(r, ed.S);
            l = min(l, ed.F);
            s.erase(s.lower_bound(ed));
        }
        s.insert(ii(l, r));
        mx = max(mx, r - l);
        cout << ans - mx << ' ';
    }

    cout << '\n';
}

int main(){
//    freopen(".inp", "r", stdin);
//    freopen(".out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t --) solve();

    return 0;
}