#include <bits/stdc++.h>
using namespace std;
long long myPow(int x, int n) {
  long long result = 1;
  for (int na = abs(n); na > 0; na >>= 1) {
    if (na % 2 == 1) {
      result *= x % 2006;
    }
    x *= x % 2006;
  }
  return n < 0 ? 1 / result : result % 2006;
}
int gcd(int m, int n) {
  if (n == 0) return m;
  return gcd(n, m % n);
}
long long binpow(int a, int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 1)
    return binpow(a, n - 1) * a;
  return binpow(a, n / 2) * binpow(a, n / 2);
}
vector<char> eratosphen(long long n) {
  vector<char> prime(n + 1, true);
  prime[0] = false;
  prime[1] = false;
  for (long long i = 2; i * i <= n; i++)
    if (prime[i])
      if (i * 1ll * i <= n)
        for (long long j = i * i; j <= n; j += i) prime[j] = false;
  return prime;
}
int g(int n) { return n ^ (n >> 1); }
bool comp(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) return (a.second < b.second);
  return (a.first < b.first);
}
int Prime(unsigned long a) {
  unsigned long i;
  if (a == 2) return 1;
  if (a == 0 || a == 1 || a % 2 == 0) return 0;
  for (i = 3; i * i <= a && a % i; i += 2)
    ;
  return i * i > a;
}
vector<int> prefix_function(string s) {
  int n = s.size();
  vector<int> pi(n);
  for (int i = 0; i < n; ++i)
    for (int k = 0; k <= i; ++k)
      if (s.substr(0, k) == s.substr(i - k + 1, k)) pi[i] = k;
  return pi;
}
int rec(int n) {
  if (n == 0) return 0;
  if (n == 1) return 1;
  if (n % 2 == 0)
    return rec(n / 2);
  else
    return rec(n / 2) + rec(n / 2 + 1);
}
bool joseph(int n, int k) {
  int res = 0;
  int c = 1;
  int m[30] = {0};
  while (true) {
    for (int i = 1; i <= n; ++i) {
      if (c % k == 0 && m[i] == 0) {
        m[i] = 1;
        c++;
        if (i <= n / 2) return false;
        if (i > n / 2) res++;
        if (res == n / 2) return true;
      }
      if (m[i] == 0) c++;
    }
  }
  return true;
}
unsigned long long super_hash_func(long long value) {
  unsigned long long hash = value;
  hash = hash + (hash << 10);
  hash = hash ^ (hash >> 6);
  hash = hash + (hash << 3);
  hash = hash ^ (hash >> 11);
  hash = hash + (hash << 16);
  return hash;
}
double c(int n, int m) {
  int B[500][500];
  for (int i = 0; i <= n; ++i) {
    B[i][0] = 1;
    B[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      B[i][j] = B[i - 1][j - 1] + B[i - 1][j];
    }
  }
  return B[n][m];
}
struct node {
  int v, sum;
  node(int a, int b) : v(a), sum(b) {}
};
bool check(vector<int>& v) {
  stack<node> st;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] < 0)
      st.push(node(v[i], v[i]));
    else {
      if (!st.empty() && st.top().v + v[i] == 0) {
        st.pop();
        if (!st.empty()) {
          node top = st.top();
          st.pop();
          top.sum += v[i];
          if (top.sum >= 0) return false;
          st.push(top);
        }
      } else
        return false;
    }
  }
  return st.empty();
}
int main() {
  int n, mas[100005], a[3][100], b[100], la[100] = {0}, lb[100];
  cin >> n;
  for (int i = 1; i <= 2; i++)
    for (int j = 1; j <= n - 1; j++) cin >> a[i][j];
  for (int i = 1; i <= n; i++) cin >> b[i];
  la[1] = 0;
  for (int i = 1; i <= n - 1; i++) la[i + 1] += la[i] + a[1][i];
  lb[n] = 0;
  for (int i = n - 1; i >= 1; i--) lb[i] = lb[i + 1] + a[2][i];
  for (int i = 1; i <= n; i++) la[i] += lb[i] + b[i];
  sort(la + 1, la + n + 1);
  cout << la[1] + la[2];
  return 0;
}
