#include <bits/stdc++.h>
using namespace std;
int num[2][110];
int main() {
  int n;
  cin >> n;
  num[0][0] = 0;
  num[1][0] = 0;
  for (int i = 1; i < n; i++) {
    cin >> num[0][i];
    num[0][i] = num[0][i] + num[0][i - 1];
  }
  for (int i = 1; i < n; i++) {
    cin >> num[1][i];
    num[1][i] = num[1][i] + num[1][i - 1];
  }
  int ans[110];
  int x;
  int k = 0;
  for (int i = 0; i < n; i++) {
    int cnt;
    cin >> x;
    cnt = x + num[0][i] + num[1][n - 1] - num[1][i];
    ans[k++] = cnt;
  }
  sort(ans, ans + n);
  cout << ans[0] + ans[1] << endl;
  return 0;
}
