#include <bits/stdc++.h>
using namespace std;
long long ditu[7000];
long long dd[5001][5001];
long long tu[5001][6];
int main() {
  long long n, s, t;
  cin >> n >> s >> t;
  for (long long a = 1; a <= n; a++) scanf("%I64d", &tu[a][1]);
  for (long long a = 1; a <= n; a++) scanf("%I64d", &tu[a][2]);
  for (long long a = 1; a <= n; a++) scanf("%I64d", &tu[a][3]);
  for (long long a = 1; a <= n; a++) scanf("%I64d", &tu[a][4]);
  for (long long a = 1; a <= n; a++) scanf("%I64d", &tu[a][5]);
  for (long long a = 1; a <= n; a++) {
    for (long long b = 1; b <= n; b++) {
      if (a == b) continue;
      if (tu[a][1] > tu[b][1])
        dd[a][b] = abs(tu[a][1] - tu[b][1]) + tu[a][4] + tu[b][3];
      else
        dd[a][b] = abs(tu[a][1] - tu[b][1]) + tu[a][5] + tu[b][2];
    }
  }
  long long lu = dd[s][t];
  ditu[1] = s, ditu[2] = t;
  long long a = 0;
  for (long long c = 1; c <= n; c++) {
    if (c == s || c == t) continue;
    a++;
    long long ss = 1e18;
    long long weizhi;
    for (long long b = 1; b <= a; b++) {
      if (ss > dd[ditu[b]][c] + dd[c][ditu[b + 1]] - dd[ditu[b]][ditu[b + 1]]) {
        weizhi = b;
        ss = dd[ditu[b]][c] + dd[c][ditu[b + 1]] - dd[ditu[b]][ditu[b + 1]];
      }
    }
    lu += ss;
    for (long long b = a + 2; b > weizhi + 1; b--) ditu[b] = ditu[b - 1];
    ditu[weizhi + 1] = c;
  }
  cout << lu;
}
