#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long n, a, tmp;
long long m[3][109], d[109][109];
long long dx[] = {0, 1}, dy[] = {1, 0};
void solve(long long x, long long y, long long tmp1) {
  for (long long i = (0); i < (2); i++) {
    long long tmpx = x + dx[i], tmpy = y + dy[i];
    if (tmpx < 1 || tmpy < 1 || tmpx > 2 || tmpy > n) continue;
    long long p1 = (x - 1) * n + y;
    long long p2 = (tmpx - 1) * n + tmpy;
    tmp1 += d[p1][p2];
    if (tmpx == 2 && tmpy == n) {
      v.push_back(tmp1);
    } else
      solve(tmpx, tmpy, tmp1);
    tmp1 -= d[p1][p2];
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (long long i = (1); i < (n); i++) {
    cin >> a;
    d[i][i + 1] = d[i + 1][i] = a;
  }
  for (long long i = (1); i < (n); i++) {
    cin >> a;
    tmp = i + n;
    d[tmp][tmp + 1] = d[tmp + 1][tmp] = a;
  }
  for (long long i = (1); i < (n + 1); i++) {
    cin >> a;
    d[i][i + n] = d[i + n][i] = a;
  }
  solve(1, 1, 0);
  sort(v.begin(), v.end());
  cout << v[0] + v[1];
  return 0;
}
