#include <bits/stdc++.h>
namespace fastinput {
inline int readChar();
template <class T = int>
inline T readInt();
template <class T>
inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size = 32768;
inline int getChar() {
  static char buf[buf_size];
  static int len = 0, pos = 0;
  if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
  if (pos == len) return -1;
  return buf[pos++];
}
inline int readChar() {
  int c = getChar();
  while (c <= 32) c = getChar();
  return c;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
  write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n--) writeChar(s[n]);
  if (end) writeChar(end);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
struct Flusher {
  ~Flusher() {
    if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
  }
} flusher;
}  // namespace fastinput
using namespace std;
using namespace fastinput;
const int N = 5e3;
int x[N], a[N], b[N], c[N], d[N];
inline long long count(int i, int j) {
  long long res = abs(x[i] - x[j]);
  if (j < i) res += c[i] + b[j];
  if (j > i) res += d[i] + a[j];
  return res;
}
int main() {
  int n, s, e;
  n = readInt();
  s = readInt();
  e = readInt();
  for (int i = 0; i < n; ++i) x[i] = readInt();
  for (int i = 0; i < n; ++i) a[i] = readInt();
  for (int i = 0; i < n; ++i) b[i] = readInt();
  for (int i = 0; i < n; ++i) c[i] = readInt();
  for (int i = 0; i < n; ++i) d[i] = readInt();
  e--;
  s--;
  long long answer = 0LL;
  answer += count(s, e);
  vector<int> path = {s, e};
  for (int i = 0; i < n; ++i) {
    long long best = 1e12;
    int bestplace = -1;
    if ((i != s) && (i != e)) {
      for (int j = 0; j < path.size() - 1; ++j) {
        long long delta = count(path[j], i) + count(i, path[j + 1]) -
                          count(path[j], path[j + 1]);
        if (delta < best) {
          best = delta;
          bestplace = j;
        }
      }
      answer += best;
      auto it = find(path.begin(), path.end(), path[bestplace]);
      it++;
      path.insert(it, i);
    }
  }
  printf("%I64d", answer);
  return 0;
}
