#include <bits/stdc++.h>
int n;
int a[2][51], b[51], run[2][51];
int l, lidx, l2, l2idx;
int c(int i) { return run[0][i] + b[i] + run[1][n - 1] - run[1][i]; }
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) scanf("%d", &a[0][i]);
  for (int i = 0; i < n - 1; i++) scanf("%d", &a[1][i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  for (int i = 1; i < n; i++) {
    run[0][i] = run[0][i - 1] + a[0][i - 1];
    run[1][i] = run[1][i - 1] + a[1][i - 1];
  }
  l = 1e9;
  for (int i = 0; i < n; i++) {
    if (c(i) < l) {
      l = c(i);
      lidx = i;
    }
  }
  l2 = 1e9;
  for (int i = 0; i < n; i++) {
    if (c(i) < l2 && i != lidx) {
      l2 = c(i);
      l2idx = i;
    }
  }
  printf("%d\n", l + l2);
}
