#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, rl, rr, ll, lr;
} p[5010];
inline long long cal(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 n, a, b, c[5010];
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i].x);
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i].rl);
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i].rr);
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i].ll);
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i].lr);
  long long tem, sum, ans = 0, k;
  c[a] = b;
  ans += cal(p[a], p[b]);
  for (int i = 1; i <= n; i++) {
    if (i == a || i == b) continue;
    sum = 100000000000;
    for (int j = a; j != b; j = c[j]) {
      tem = cal(p[j], p[i]) + cal(p[i], p[c[j]]) - cal(p[j], p[c[j]]);
      if (tem < sum) {
        sum = tem;
        k = j;
      }
    }
    ans += sum;
    c[i] = c[k];
    c[k] = i;
  }
  printf("%lld\n", ans);
  return 0;
}
