#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define endl '\n'
#define Endl '\n'

using namespace std;

const int N = 2e5 + 5;
int tc, n, m, a[N], b[N], c[N];
ll dp[N][3];

ll rec(int idx, int lastTaken) {
    if (idx == n) {
        return 0;
    }
    ll &ret = dp[idx][lastTaken];
    if (~ret) {
        return ret;
    }
    ret = 0;
    if (lastTaken == 0) {
        ret = max(ret, b[idx] + rec(idx + 1, 1));
        ret = max(ret, c[idx] + rec(idx + 1, 2));
    }
    if (lastTaken == 1) {
        ret = max(ret, a[idx] + rec(idx + 1, 0));
        ret = max(ret, c[idx] + rec(idx + 1, 2));
    }
    if (lastTaken == 2) {
        ret = max(ret, a[idx] + rec(idx + 1, 0));
        ret = max(ret, b[idx] + rec(idx + 1, 1));
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); // cout.tie(0);
    cin >> tc;
    while (tc--) {
        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];
        }
        memset(dp, -1, sizeof dp);
        ll res = max({rec(0, 0), rec(0, 1), rec(0, 2)});
        cout << res << endl;
    }

    return 0;
}