#include <bits/stdc++.h>
using namespace std;
int a[2][60];
int b[60];
int p[60];
int n;
int q[60];
int h[60];
int main() {
  cin >> n;
  for (int i = 0; i < 2; i++)
    for (int j = 1; j < n; j++) scanf("%d", &a[i][j]);
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
  q[1] = 0;
  for (int i = 2; i <= n; i++) q[i] = q[i - 1] + a[0][i - 1];
  p[n] = 0;
  for (int i = n - 1; i >= 1; i--) p[i] = p[i + 1] + a[1][i];
  for (int i = 1; i <= n; i++) h[i] = p[i] + q[i] + b[i];
  sort(h + 1, h + 1 + n);
  cout << h[1] + h[2] << endl;
}
