#include <bits/stdc++.h>
using namespace std;
inline int ri() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T>
inline bool smax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool smin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const long long inf = 1e18, maxn = 5001;
long long p[maxn][maxn], n, s, e, x[maxn], a[maxn], b[maxn], c[maxn], d[maxn];
int main() {
  for (int i = 0; i < (maxn); i++)
    for (int j = 0; j < (maxn); j++) p[i][j] = inf;
  cin >> n >> s >> e;
  for (int i = 0; i < (n); i++) cin >> x[i];
  for (int i = 0; i < (n); i++) cin >> a[i];
  for (int i = 0; i < (n); i++) cin >> b[i];
  for (int i = 0; i < (n); i++) cin >> c[i];
  for (int i = 0; i < (n); i++) cin >> d[i];
  if (s > e) {
    s = n - s;
    e = n - e;
    reverse(x, x + n);
    reverse(a, a + n);
    reverse(b, b + n);
    reverse(c, c + n);
    reverse(d, d + n);
    for (int i = 0; i < (n); i++) {
      swap(a[i], b[i]);
      swap(c[i], d[i]);
      x[i] = -x[i];
    }
  } else {
    s--;
    e--;
  }
  if (s == 0)
    p[1][1] = d[0] - x[0];
  else
    p[1][1] = d[0] + b[0] - 2 * x[0];
  for (int i = (1); i < (n); i++) {
    if (i < s || i > e) {
      for (int j = (1); j < (i + 1); j++) {
        smin(p[i + 1][j - 1], p[i][j] + 2 * x[i] + a[i] + c[i]);
        smin(p[i + 1][j], p[i][j] + a[i] + d[i]);
        smin(p[i + 1][j], p[i][j] + b[i] + c[i]);
        smin(p[i + 1][j + 1], p[i][j] - 2 * x[i] + b[i] + d[i]);
      }
    } else if (s < i && i < e) {
      for (int j = (1); j < (i + 1); j++) {
        if (j > 1) {
          smin(p[i + 1][j - 1], p[i][j] + 2 * x[i] + a[i] + c[i]);
          smin(p[i + 1][j], p[i][j] + b[i] + c[i]);
        }
        smin(p[i + 1][j], p[i][j] + a[i] + d[i]);
        smin(p[i + 1][j + 1], p[i][j] - 2 * x[i] + b[i] + d[i]);
      }
    } else if (i == s) {
      for (int j = (1); j < (i + 1); j++) {
        smin(p[i + 1][j], p[i][j] + x[i] + c[i]);
        smin(p[i + 1][j + 1], p[i][j] - x[i] + d[i]);
      }
    } else if (i == e) {
      for (int j = (1); j < (i + 1); j++) {
        smin(p[i + 1][j - 1], p[i][j] + x[i] + a[i]);
        smin(p[i + 1][j], p[i][j] - x[i] + b[i]);
      }
    }
  }
  cout << p[n][0] << endl;
  return 0;
}
