#include <bits/stdc++.h>
using namespace std;
const int N = 50;
const int H = 1000 * 1000;
int n, a[2][N + 19], b[N + 19], ans[N + 19], Wait[2][N + 19];
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < n - 1; j++) cin >> a[i][j];
  }
  for (int i = 0; i < n; i++) cin >> b[i];
  for (int i = 1; i <= n - 1; i++) Wait[0][i] = Wait[0][i - 1] + a[0][i - 1];
  for (int i = n - 2; i >= 0; i--) {
    Wait[1][i] = Wait[1][i + 1] + a[1][i];
  }
  for (int i = 0; i < n; i++) {
    ans[i] = Wait[0][i] + Wait[1][i] + b[i];
  }
  sort(ans, ans + n);
  cout << ans[0] + ans[1] << endl;
  return 0;
}
