#include <bits/stdc++.h>
const int maxn = 64;
int a[2][maxn], b[maxn], sum[2][maxn], ans[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < n - 1; j++) scanf("%d", &a[i][j]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  sum[0][0] = 0;
  for (int i = 1; i < n; i++) sum[0][i] = sum[0][i - 1] + a[0][i - 1];
  sum[1][n - 1] = 0;
  for (int i = n - 2; i >= 0; i--) sum[1][i] = sum[1][i + 1] + a[1][i];
  for (int i = 0; i < n; i++) {
    ans[i] = sum[0][i] + sum[1][i] + b[i];
  }
  int res = 0;
  int k, min = ans[0], dex = 0;
  for (k = 1; k < n; k++) {
    if (min > ans[k]) {
      min = ans[k];
      dex = k;
    }
  }
  res += min;
  min = 100000000;
  for (k = 0; k < n; k++) {
    if (min > ans[k] && k != dex) min = ans[k];
  }
  res += min;
  printf("%d\n", res);
  return 0;
}
