#include <bits/stdc++.h>
using namespace std;
vector<int> r1, r2, cr;
int main() {
  int n, prev = 0;
  cin >> n;
  r1.push_back(0);
  r2.push_back(0);
  for (int i = 0; i < n - 1; i++) {
    int w;
    cin >> w;
    w += prev;
    prev = w;
    r1.push_back(w);
  }
  prev = 0;
  for (int i = 0; i < n - 1; i++) {
    int w;
    cin >> w;
    w += prev;
    prev = w;
    r2.push_back(w);
  }
  for (int i = 0; i < n; i++) {
    int w;
    cin >> w;
    cr.push_back(w);
  }
  int minl = cr[0] + r2[n - 1], pos = 0;
  for (int i = 0; i < n; i++) {
    int cal = cr[i] + r1[i] + (r2[n - 1] - r2[i]);
    if (cal < minl) {
      pos = i;
      minl = cal;
    }
  }
  int minl2 = 100000;
  for (int i = 0; i < n; i++) {
    if (i == pos) {
      continue;
    }
    int cal = cr[i] + r1[i] + (r2[n - 1] - r2[i]);
    if (cal < minl2) {
      minl2 = cal;
    }
  }
  cout << minl + minl2;
}
