#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
#define ll long long
#define mod 1000000007
#define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}
const int N = 1e5 + 10;
void solve()
{
    int n, m;
    cin >> n;
    vector<int> v(n + 1), v1(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
        if(v[i]<0 && abs(v[i])>i && i!=n)v[i]=-i;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> v1[i];
        if(v1[i]<0 && abs(v1[i])>i && i!=n)v1[i]=-i;
    }
    vector<int> pre1(n + 1), pre2(n + 1);
    pre1[1] = v[1], pre2[1] = v1[1];
    for (int i = 2; i <= n; i++)
    {
        pre1[i] = pre1[i - 1] + v[i];
        pre2[i] = pre2[i - 1] + v1[i];
    }
    ll mx = LONG_LONG_MIN,id;
    for (int i = 1; i <= n; i++)
    {
        ll res=(pre1[i]+pre2[n]-pre2[i-1]);
        mx = max(mx, res);
    }
    cout << mx << endl;
}
int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}