#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10;
const int p = 1e6 + 7;
int a[N] , b[N] , c[N] , dp1[N] , dp2[N] , dp3[N];
signed main()
{
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif

    ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
    int T; cin>>T;
    while (T--)
    {
        int n;cin >> n;
        for(int i = 1;i <= n;i++) cin >> a[i];
        for(int i = 1;i <= n;i++) cin >> b[i];
        for(int i = 1;i <= n;i++) cin >> c[i];
        for(int i = 1;i <= n;i++)
        {
            dp1[i] = max(dp2[i - 1] , dp3[i - 1]) + a[i];
            dp2[i] = max(dp1[i - 1] , dp3[i - 1]) + b[i];
            dp3[i] = max(dp1[i - 1] , dp2[i - 1]) + c[i];
        }
        cout << max(max(dp1[n] , dp2[n]) , dp3[n])<<endl;
    }
    
    return 0;
}