/**
 *  written by Binoy Barman .
**/

#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#define all(v) v.begin(), v.end()
#define Too_Many_Jobs int tts, tc = 1; cin >> tts; hell: while(tts--)
#define Dark_Lord_Binoy ios_base::sync_with_stdio(false); cin.tie(NULL);

#ifdef LOCAL
#include "unravel.hpp"
#else
#define dbg(...) 42
#endif
#define ll long long

int32_t main() {
Dark_Lord_Binoy
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    Too_Many_Jobs {
        ll n;
        cin >> n;
        ll a[3][n], dp[3][n];
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < n; j++) {
                cin >> a[i][j];
            }
        }
        dp[0][0] = a[0][0], dp[1][0] = a[1][0], dp[2][0] = a[2][0];
        for (int i = 1; i < n; i++) {
            dp[0][i] = max(dp[1][i - 1], dp[2][i - 1]) + a[0][i];
            dp[1][i] = max(dp[0][i - 1], dp[2][i - 1]) + a[1][i];
            dp[2][i] = max(dp[0][i - 1], dp[1][i - 1]) + a[2][i];
        }
        cout << max({dp[0][n - 1], dp[1][n - 1], dp[2][n - 1]}) << nl;
    }

    return 0;
}