#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> s(n), t(n);
    for (int i = 0; i < n; i++) {
        std::cin >> s[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> t[i];
    }
    
    for (int i = 0; i < n; i++) {
        if (s[i] == 0 && t[i] != 0) {
            std::cout << -1 << "\n";
            return;
        }
    }
    
    std::vector<int> d(n + 1);
    for (int i = 0, j = -1; i <= n; i++) {
        if (i == n || t[i] != 0) {
            int v = (i == n ? 0 : t[i] - s[i]);
            int u = (j == -1 ? 0 : t[j] - s[j]);
            if (v > u) {
                d[i] += v - u;
            } else {
                d[j + 1] += v - u;
            }
            j = i;
        }
    }
    i64 ans = 0;
    for (int i = 0; i <= n; i++) {
        ans += std::abs(d[i]);
    }
    ans /= 2;
    
    std::vector<i64> pre(n), suf(n);
    for (int i = 0; i < n; i++) {
        pre[i] = (i ? pre[i - 1] : 0) + std::min(d[i], 0);
    }
    for (int i = n - 1; i >= 0; i--) {
        suf[i] = (i < n - 1 ? suf[i + 1] : 0) + std::max(d[i + 1], 0);
    }
    
    std::vector<int> a, b;
    for (int i = 0; i < n; i++) {
        if (t[i] == 0) {
            a.push_back(std::max(0LL, s[i] + pre[i]));
            b.push_back(std::max(0LL, s[i] - suf[i]));
        }
    }
    n = a.size();
    int max = 0;
    int res = 0;
    for (int i = 0; i < n; i++) {
        res = std::max(res, max + b[i]);
        max = std::max(max, a[i]);
    }
    ans += res;
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}