// #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define endl '\n'
#define lowbits(x) ((x)&((-x)))
#define INF 0x3f3f3f3f
#define uu __int128
#define PI acos(-1)
#define ls k<<1
#define rs k<<1|1
using namespace std;
typedef  long long ll;
typedef  unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, pair<int, int> > PII;
constexpr int N=5e5+10, M=2*N;
constexpr int mod=998244353;
constexpr double eps=1e-9;
int nx[] = {0, 0, 1, -1}, ny[] = {1, -1, 0, 0};


int n;
int a[N], b[N];
int c[N], d[N];
void solve(){
    cin >> n;
    for(int i=0; i<n; ++i)cin >> a[i], a[0] = INF, c[i] = a[i];
    for(int i=0; i<n; ++i)cin >> b[i], b[0] = INF, d[i] = b[i];
    ll res = 0;
    bool f = false;
    for(int i=n-1, j=0; i>=0; --i){
        if(!a[i])continue;
        while(j < n && (!b[j] || i+j<n-1))++j;
        if(j==n)break;
        if(i+j >= n)f = true;
        int d = min(a[i], b[j]);
        a[i] -= d;
        b[j] -= d;
        res += d;
        if(a[i])++i;
    }
    if(a[n-1])res += a[n-1];
    if(b[n-1])res += b[n-1];

    if(f){
        cout << res << endl;return;
    }
    ll ans = 0;
    for(int i=0; i<n; ++i)a[i] = c[i], b[i] = d[i];
    int t = 0;
    for(int i=n-1, j=0; i>=0; --i){
        if(!a[i])continue;
        while(j < n && (!b[j] || i+j+t<n))++j;
        if(j==n)break;
        if(t == 0){
            t = 1;
            a[i]--;
            b[j]--;
            j = 0, i = n;
            ++ans;
            continue;
        }
        int d = min(a[i], b[j]);
        a[i] -= d;
        b[j] -= d;
        ans += d;
        if(a[i])++i;
    }
    if(a[n-1] + t >= n)ans += a[n-1];
    if(b[n-1] + t >= n)ans += b[n-1];

    cout << ans << endl;


}


signed main()
{   
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    int t = 1;
    // cout << fixed << setprecision(9)
    cin >> t;
    while(t--)solve();
    return 0;

}