#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  bool p = 0;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') p = 1;
  for (; c >= '0' && c <= '9'; c = getchar())
    x = (x << 3) + (x << 1) + (c ^ 48);
  if (p) x = -x;
}
const int N = 5005;
int nxt[N];
long long a[N], b[N], c[N], d[N], x[N], s, e, n;
long long calc(int i, int j) {
  if (i > j) return x[i] - x[j] + c[i] + b[j];
  return x[j] - x[i] + d[i] + a[j];
}
int main() {
  read(n);
  read(s);
  read(e);
  nxt[s] = e;
  for (int i = 1; i <= n; ++i) read(x[i]);
  for (int i = 1; i <= n; ++i) read(a[i]);
  for (int i = 1; i <= n; ++i) read(b[i]);
  for (int i = 1; i <= n; ++i) read(c[i]);
  for (int i = 1; i <= n; ++i) read(d[i]);
  for (int i = 1; i <= n; ++i) {
    long long minn = 1000000000000000;
    int id = 0;
    if (i == s || i == e) continue;
    for (int j = s; j != e; j = nxt[j]) {
      int S = j, T = nxt[j];
      long long tmp = calc(S, i) + calc(i, T) - calc(S, T);
      if (tmp < minn) {
        minn = tmp;
        id = S;
      }
    }
    nxt[i] = nxt[id];
    nxt[id] = i;
  }
  long long ans = 0;
  for (int i = s; i != e; i = nxt[i]) {
    ans += calc(i, nxt[i]);
  }
  printf("%lld\n", ans);
  return 0;
}
