#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long double EPS = 1e-8;
int main() {
  int n;
  scanf("%d", &n);
  vector<vector<int>> a(2, vector<int>(n - 1));
  for (int i = 0; i < (int)(2); i++)
    for (int j = 0; j < (int)(n - 1); j++) scanf("%d", &a[i][j]);
  vector<int> b(n);
  for (int i = 0; i < (int)(n); i++) scanf("%d", &b[i]);
  vector<int> tm(n, 0);
  for (int i = 0; i < (int)(n); i++) {
    for (int j = 0; j < (int)(i); j++) tm[i] += a[0][j];
    tm[i] += b[i];
    for (int j = i; j < n - 1; j++) tm[i] += a[1][j];
  }
  sort(tm.begin(), tm.end());
  cout << tm[0] + tm[1] << endl;
  return 0;
}
