#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;
int n;
vector<int>a(N),b(N),c(N);
ll mx=LONG_LONG_MIN;
ll rec(ll sum,int i,int prev)
{
    if(i>=n)
    {
        mx=max(sum,mx);
        return 0;
    }
    if(prev==-1)
    {
        rec(sum+a[i],i+1,1);
        rec(sum+b[i],i+1,2);
        rec(sum+c[i],i+1,3);
    }
    else
    {
        if(prev==1)
        {
            rec(sum+b[i],i+1,2);
            rec(sum+c[i],i+1,3);
        }
        else if(prev==2)
        {
            rec(sum+a[i],i+1,1);
            rec(sum+c[i],i+1,3);
        }
        else
        {
            rec(sum+a[i],i+1,1);
            rec(sum+b[i],i+1,2);
        }
    }
}
void solve()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> c[i];
    }
    rec(0,0,-1);
    cout<<mx<<endl;
}
int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
        mx=LONG_LONG_MIN;
    }
}