#include <bits/stdc++.h>
using namespace std;
int line[100] = {0}, line1[100] = {0}, ans[100] = {0};
int main() {
  int n, temp;
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; i++) {
    scanf("%d", &temp);
    line[i] = line[i - 1] + temp;
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d", &line1[i]);
  }
  temp = 0;
  for (int i = n - 2; i >= 0; i--) {
    temp = line1[i];
    line1[i] = line1[i + 1] + temp;
  }
  for (int i = 0; i <= n - 1; i++) {
    scanf("%d", &temp);
    ans[i] = line[i] + line1[i] + temp;
  }
  sort(ans, ans + n);
  printf("%d\n", ans[1] + ans[0]);
  return 0;
}
