#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 7;
long long a[N], b[N], c[N], d[N], x[N], n, s, e;
vector<int> vec;
long long cal(int i, int j) {
  long long res = abs(x[i] - x[j]);
  if (i > j)
    res += c[i] + b[j];
  else
    res += d[i] + a[j];
  return res;
}
int main() {
  cin >> n >> s >> e;
  for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
  vec.push_back(s);
  vec.push_back(e);
  for (int i = 1; i <= n; i++) {
    if (i == s || i == e) continue;
    long long minDist = 1ll << 60;
    int id = -1;
    for (int j = 0; j < vec.size() - 1; j++) {
      long long tmp =
          cal(vec[j], i) + cal(i, vec[j + 1]) - cal(vec[j], vec[j + 1]);
      if (tmp < minDist) {
        minDist = tmp;
        id = j;
      }
    }
    vec.insert(vec.begin() + id + 1, i);
  }
  long long ans = 0;
  for (int i = 0; i < vec.size() - 1; i++) ans += cal(vec[i], vec[i + 1]);
  cout << ans << endl;
  return 0;
}
