#include <bits/stdc++.h>
using namespace std;
const int N = 10001000;
int n, t;
int a1[100], a2[100], b[100];
void solve() {
  cin >> n;
  for (int i = 0; i < n - 1; ++i) cin >> a1[i];
  for (int i = 0; i < n - 1; ++i) cin >> a2[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  int bes = 1e9;
  for (int i = 0; i < n; ++i) {
    int ans = 0;
    for (int j = 0; j < i; ++j) ans += a1[j];
    ans += b[i];
    for (int j = i; j < n - 1; ++j) ans += a2[j];
    for (int k = 0; k < n; ++k) {
      if (k == i) continue;
      int ans1 = 0;
      for (int j = 0; j < k; ++j) ans1 += a1[j];
      ans1 += b[k];
      for (int j = k; j < n - 1; ++j) ans1 += a2[j];
      bes = min(bes, ans1 + ans);
    }
  }
  cout << bes << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
