#include <bits/stdc++.h>
void shellsort(int v[], int n) {
  int gap, i, j, temp;
  for (gap = n / 2; gap > 0; gap /= 2)
    for (i = gap; i < n; i++)
      for (j = i - gap; j >= 0 && v[j] >= v[j + gap]; j -= gap) {
        temp = v[j];
        v[j] = v[j + gap];
        v[j + gap] = temp;
      }
}
int main() {
  int a[50], b[50], c[50], d[50];
  int t, i, j, k, n, q, w, e, r, s;
  t = 0;
  scanf("%d", &n);
  for (i = 0; i < n - 1; i++) scanf("%d", &a[i]);
  for (j = 0; j < n - 1; j++) scanf("%d", &b[j]);
  for (k = 0; k <= n - 1; k++) scanf("%d", &c[k]);
  for (i = 0; i < n; i++) {
    w = 0;
    r = 0;
    for (q = 0; q < i; q++) w = w + a[q];
    for (e = i; e < n - 1; e++) r = r + b[e];
    d[t] = c[i] + w + r;
    ++t;
  }
  shellsort(d, n);
  s = d[1] + d[0];
  printf("%d\n", s);
}
