#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
const int N = 1000;
int n, a[3][N], b[N], mi;
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) cin >> a[1][i];
  for (int i = 1; i < n; i++) cin >> a[2][i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  mi = (1 << 30);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int cos = 0;
      if (i == j) continue;
      for (int k = n; k > i; k--) cos += a[2][k - 1];
      for (int k = i; k > 1; k--) cos += a[1][k - 1];
      for (int k = 1; k < j; k++) cos += a[1][k];
      for (int k = j; k < n; k++) cos += a[2][k];
      cos += b[i];
      cos += b[j];
      umin(mi, cos);
    }
  }
  cout << mi << "\n";
  return 0;
}
