#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int fw[n + 2];
  int bw[n + 2];
  int b[n + 1];
  memset(fw, 0, sizeof fw);
  memset(bw, 0, sizeof bw);
  memset(b, 0, sizeof b);
  for (int i = 1; i <= n - 1; ++i) cin >> fw[i];
  for (int i = 1; i <= n - 1; ++i) cin >> bw[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  for (int i = 1; i < n; ++i) fw[i] += fw[i - 1];
  for (int i = n - 1; i >= 1; --i) bw[i] += bw[i + 1];
  vector<int> v;
  for (int i = 0; i < n; ++i) {
    v.push_back(fw[i] + bw[i + 1] + b[i]);
  }
  sort(v.begin(), v.end());
  cout << v[0] + v[1] << endl;
}
