#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 200010;
const double eps = 1e-7;
void fre() { freopen("in.txt", "r", stdin); }
void freout() { freopen("out.txt", "w", stdout); }
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
struct node {
  long long x;
  long long rl, rr, ll, lr;
} p[5010];
long long fun(node a, node b) {
  if (b.x < a.x) return abs(b.x - a.x) + a.ll + b.rr;
  return abs(b.x - a.x) + a.lr + b.rl;
}
long long net[5010];
int main() {
  int n, a, b;
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 1; i <= n; i++) scanf("%I64d", &p[i].x);
  for (int i = 1; i <= n; i++) scanf("%I64d", &p[i].rl);
  for (int i = 1; i <= n; i++) scanf("%I64d", &p[i].rr);
  for (int i = 1; i <= n; i++) scanf("%I64d", &p[i].ll);
  for (int i = 1; i <= n; i++) scanf("%I64d", &p[i].lr);
  long long tem, sum, ans = 0;
  int k;
  net[a] = b;
  ans += fun(p[a], p[b]);
  for (int i = 1; i <= n; i++) {
    if (i == a || i == b) continue;
    sum = 1e18;
    for (int j = a; j != b; j = net[j]) {
      tem = fun(p[j], p[i]) + fun(p[i], p[net[j]]) - fun(p[j], p[net[j]]);
      if (tem < sum) {
        sum = tem;
        k = j;
      }
    }
    ans += sum;
    net[i] = net[k];
    net[k] = i;
  }
  printf("%I64d\n", ans);
  return 0;
}
