#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 5;
const long long inf = 1e16;
int nxt[maxn];
long long x[maxn], a[maxn], b[maxn], c[maxn], d[maxn], atlas[maxn][maxn];
int n, s, e;
int main() {
  scanf("%d%d%d", &n, &s, &e);
  for (int i = 1; i <= n; i++) scanf("%d", x + i);
  for (int i = 1; i <= n; i++) scanf("%lld", a + i);
  for (int i = 1; i <= n; i++) scanf("%lld", b + i);
  for (int i = 1; i <= n; i++) scanf("%lld", c + i);
  for (int i = 1; i <= n; i++) scanf("%lld", d + i);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (j == i)
        continue;
      else if (i > j)
        atlas[i][j] = abs(x[i] - x[j]) + c[i] + b[j];
      else
        atlas[i][j] = abs(x[i] - x[j]) + d[i] + a[j];
    }
  nxt[s] = e;
  long long ans = atlas[s][e];
  for (int i = 1; i <= n; i++) {
    if (i == s || i == e) continue;
    long long sum = inf;
    int par;
    for (int j = s; j != e; j = nxt[j]) {
      int from = j, to = nxt[j];
      if (sum > ans - atlas[from][to] + atlas[from][i] + atlas[i][to]) {
        par = j;
        sum = ans - atlas[from][to] + atlas[from][i] + atlas[i][to];
      }
    }
    nxt[i] = nxt[par], nxt[par] = i;
    ans = sum;
  }
  printf("%lld\n", ans);
  return 0;
}
