#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long a[100], b[100], c[100];
void solve() {
  long long i, j, k;
  long long n;
  cin >> n;
  for (i = 0; i <= n - 2; i++) cin >> a[i];
  for (i = 0; i <= n - 2; i++) cin >> b[i];
  for (i = 0; i <= n - 1; i++) cin >> c[i];
  reverse(b, b + n - 1);
  vector<long long> pa, sb, sum;
  pa.push_back(0);
  sb.push_back(0);
  for (i = 0; i <= n - 2; i++) {
    pa.push_back(a[i] + pa[i]);
    sb.push_back(b[i] + sb[i]);
  }
  reverse(sb.begin(), sb.end());
  for (i = 0; i <= n - 1; i++) {
    sum.push_back(pa[i] + sb[i] + c[i]);
  }
  sort(sum.begin(), sum.end());
  cout << sum[0] + sum[1] << endl;
}
