#include <bits/stdc++.h>
using namespace std;
int vis[6000];
int dp[5][100], mp[5][55], num[55];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= 2; i++)
    for (int j = 1; j < n; j++) cin >> mp[i][j];
  for (int i = 1; i <= n; i++) cin >> num[i];
  memset(dp, 0, sizeof dp);
  for (int i = n - 1; i >= 1; i--) dp[2][i] = dp[2][i + 1] + mp[2][i];
  int t1 = 10000000, t2 = 10000000, cnt = 0;
  for (int i = 1; i <= n; i++) {
    int kl = dp[2][i] + num[i] + cnt;
    if (kl < t2) {
      if (kl < t1)
        t2 = t1, t1 = kl;
      else
        t2 = kl;
    }
    cnt += mp[1][i];
  }
  int ans = t1 + t2;
  cout << ans << endl;
  return 0;
}
