/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
using ll=long long;

//ofstream file("output1.txt");

void solve()
{
    int n; cin>>n;
    ll a[2][n+1]={0}, b[2][n+1];
    a[0][0]=0;
    a[1][0]=0;
    for(int i=0;i<2;i++)
    {
        for(ll j=1;j<=n;j++)
        {
            cin>>b[i][j];
            a[i][j] = max(b[i][j],j*(-1));
        }
    }
    a[1][n] = b[1][n];

    for(int i=2;i<=n;i++) a[0][i] += a[0][i-1];
    for(int i=2;i<=n;i++) a[1][i] += a[1][i-1];

    ll score = b[0][1]+b[1][1]+(a[1][n]-a[1][1]);
    for(int i=2;i<=n;i++)
    {
        score = max(score , (a[0][i-1]+b[0][i]+b[1][i]+(a[1][n]-a[1][i])));
    }

    cout<<score<<endl;
    //file<<score<<endl;
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //freopen("input1.txt","r",stdin);
    int t; cin>>t; while(t--) solve();
}