#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const int MAXV = 1000005;
int a[2][55], b[55], sum_a[2][55], n;
int main() {
  while (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];
    memset(sum_a, 0, sizeof(sum_a));
    for (int i = 1; i < n; i++) {
      sum_a[0][i] = sum_a[0][i - 1] + a[0][i - 1];
    }
    for (int i = n - 2; i >= 0; i--) {
      sum_a[1][i] = sum_a[1][i + 1] + a[1][i];
    }
    int first = INF, second = INF;
    int ans = 0;
    for (int i = n - 1; i >= 0; i--) {
      int cur = b[i] + sum_a[1][i] + sum_a[0][i];
      if (cur < first) {
        second = first;
        first = cur;
      } else if (cur == first) {
        second = cur;
      } else if (cur < second) {
        second = cur;
      }
    }
    printf("%d\n", first + second);
  }
  return 0;
}
