#include <bits/stdc++.h>
using namespace std;
int n;
int x[110], y[110], z[110];
int kq;
int mang[110];
void sx() {
  int i, j;
  int tg;
  for (i = 1; i < n; i++) {
    for (j = i + 1; j <= n; j++) {
      if (mang[i] > mang[j]) {
        tg = mang[i];
        mang[i] = mang[j];
        mang[j] = tg;
      }
    }
  }
}
void solve() {
  int i, j;
  int tong;
  for (i = 1; i <= n; i++) {
    tong = z[i];
    for (j = 1; j < i; j++) {
      tong = tong + x[j];
    }
    for (j = i; j < n; j++) {
      tong = tong + y[j];
    }
    mang[i] = tong;
  }
  sx();
  printf("%d\n", mang[1] + mang[2]);
}
int main() {
  int i;
  while (scanf("%d", &n) > 0) {
    for (i = 1; i < n; i++) {
      scanf("%d", &x[i]);
    }
    for (i = 1; i < n; i++) {
      scanf("%d", &y[i]);
    }
    for (i = 1; i <= n; i++) {
      scanf("%d", &z[i]);
    }
    solve();
  }
  return 0;
}
