#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long int
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define endl "\n"
vector<int> takeVectorInput(int n){
    vector<int>v(n);
    for(auto &ele:v)cin>>ele;


//     vector<int>v(n+1);
//    for(int i=1;i<=n;++i) {
//     cin>>v[i];
//    }
    return v;
}
int n;
const int N=1e5+123;
int dp[N][2][2][2];
int fun(int i,vector<int>&a,vector<int>&b,vector<int>&c,int aNisi,int bNisi,int cNisi){
    if(i==n)return 0;
    if(dp[i][aNisi][bNisi][cNisi]!=-1e5)return dp[i][aNisi][bNisi][cNisi];
    int ret=0;
    if(!aNisi){
        ret=max(ret,fun(i+1,a,b,c,1,0,0)+a[i]);
    }
    if(!bNisi){
        ret=max(ret,fun(i+1,a,b,c,0,1,0)+b[i]);
    }
    if(!cNisi){
        ret=max(ret,fun(i+1,a,b,c,0,0,1)+c[i]);
    }
    return dp[i][aNisi][bNisi][cNisi]=ret;
}
void solve(){
    
    cin>>n;
    auto a=takeVectorInput(n);
    auto b=takeVectorInput(n);
    auto c=takeVectorInput(n);

    for(int i=0;i<=n;++i){
        for(int j=0;j<=1;++j){
        for(int k=0;k<=1;++k){
        for(int l=0;l<=1;++l){
            dp[i][j][k][l]=-1e5;
        }
        }
    }}
    cout<<fun(0,a,b,c,0,0,0)<<endl;
}
signed main(){
    fast
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}