#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3", "sse2", "sse")
#pragma GCC target("avx", "sse4", "sse4.1", "sse4.2", "ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline", "fast-math", "unroll-loops", \
                     "no-stack-protector")
#pragma GCC push_options
#pragma GCC pop_options
#pragma GCC reset_options
#pragma GCC optimize("O3")
const double eps = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const long long LINF = 455743088879883099LL;
const double DINF = numeric_limits<double>::infinity();
const long long MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
const double PI = 3.141592653589793;
inline void fastll(long long &input_number) {
  input_number = 0;
  int ch = getchar_unlocked();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar_unlocked();
  }
  while (ch >= '0' && ch <= '9') {
    input_number = (input_number << 3) + (input_number << 1) + ch - '0';
    ch = getchar_unlocked();
  }
  input_number *= sign;
}
inline void open(string a) {
  freopen((a + ".in").c_str(), "r", stdin);
  freopen((a + ".out").c_str(), "w", stdout);
}
inline void fasterios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long n, s, e;
long long memo[5005][5005];
long long x[5005], a[5005], b[5005], c[5005], d[5005];
long long dp(long long pos, long long cc) {
  if (pos > n && cc == 1) return 0;
  if (pos > n) return LINF;
  if (memo[pos][cc] != -1) return memo[pos][cc];
  long long ret = LINF;
  long long UjungKiri = (pos > s);
  long long UjungKanan = (pos > e);
  long long ujung = UjungKiri + UjungKanan;
  if (ujung == 2 && cc == 1) return LINF;
  long long cost = (x[pos] - x[pos - 1]) * ((2 * cc) - ujung);
  if (pos == s) {
    ret = min(ret, dp(pos + 1, cc + 1) + d[pos]);
    if (cc >= 1) ret = min(ret, dp(pos + 1, cc) + c[pos]);
  } else if (pos == e) {
    ret = min(ret, dp(pos + 1, cc + 1) + b[pos]);
    if (cc >= 1) ret = min(ret, dp(pos + 1, cc) + a[pos]);
  } else {
    if (cc - UjungKiri >= 1) ret = min(ret, dp(pos + 1, cc) + b[pos] + c[pos]);
    if (cc - UjungKanan >= 1) ret = min(ret, dp(pos + 1, cc) + a[pos] + d[pos]);
    if (cc >= 2) ret = min(ret, dp(pos + 1, cc - 1) + a[pos] + c[pos]);
    ret = min(ret, dp(pos + 1, cc + 1) + b[pos] + d[pos]);
  }
  return memo[pos][cc] = ret + cost;
}
int main() {
  memset(memo, -1, sizeof(memo));
  fastll(n);
  fastll(s);
  fastll(e);
  for (int i = 1; i <= n; i++) fastll(x[i]);
  for (int i = 1; i <= n; i++) fastll(a[i]);
  for (int i = 1; i <= n; i++) fastll(b[i]);
  for (int i = 1; i <= n; i++) fastll(c[i]);
  for (int i = 1; i <= n; i++) fastll(d[i]);
  printf("%lld\n", dp(1, 0));
  return 0;
}
