#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, map[3][51], i, j, aven[51], go[51], back[51];
  while (cin >> n) {
    memset(map, 0, sizeof(map));
    memset(aven, 0, sizeof(aven));
    memset(go, 0, sizeof(go));
    memset(back, 0, sizeof(back));
    for (i = 1; i <= 2; ++i) {
      for (j = 1; j < n; ++j) {
        cin >> map[i][j];
      }
    }
    for (i = 1; i <= n; ++i) {
      cin >> aven[i];
    }
    int count, _count, k, ans = 1000000;
    int ii, jj, kk;
    for (i = 1; i <= n; ++i) {
      count = 0;
      for (k = 1; k <= i; ++k) {
        count += map[1][k - 1];
      }
      count += aven[i];
      for (j = i; j < n; ++j) {
        count += map[2][j];
      }
      go[i] = count;
    }
    for (ii = n; ii >= 1; --ii) {
      _count = 0;
      for (kk = n; kk >= ii; --kk) {
        _count += map[2][kk];
      }
      _count += aven[ii];
      for (jj = ii; jj >= 1; --jj) {
        _count += map[1][jj - 1];
      }
      back[ii] = _count;
    }
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= n; ++j) {
        if (i != j) {
          if (ans > go[i] + back[j]) ans = go[i] + back[j];
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
