#include<bits/stdc++.h>
typedef long long   ll;
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout<<it<<" "; cout<<endl;
#define _ASRafi__   ios::sync_with_stdio(false); cin.tie(0);
using namespace std;

const int N = 1e5 + 7;
ll n;
ll a[N], b[N], c[N];

ll rec(int i, short back, vector<vector<ll>> &dp)
{
    if(i >= n) return 0;
    if(dp[i][back] != -1) return dp[i][back];
    ll ans = LLONG_MIN;
    if(back != 1) ans = max(ans, a[i] + rec(i + 1, 1, dp));
    if(back != 2) ans = max(ans, b[i] + rec(i + 1, 2, dp));
    if(back != 3) ans = max(ans, c[i] + rec(i + 1, 3, dp));
    // cout << i << ", " << back << " => " << ans << endl;
    return dp[i][back] = ans;
}

void solve()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        a[i] = x;
    }
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        b[i] = x;
    }
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        c[i] = x;
    }
    vector<vector<ll>> dp(n + 3, vector<ll> (4, -1));
    cout << rec(0, 0, dp) << endl;
    return;
}

int32_t main()
{
    _ASRafi__;
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}