#include <bits/stdc++.h>
using namespace std;
const long long LLINF = 1e18;
const int MAX_N = 5e3 + 11;
long long sum;
int n, s, e;
int arr[MAX_N];
int x[MAX_N], a[MAX_N], b[MAX_N], c[MAX_N], d[MAX_N];
inline long long calc(int i, int j) {
  if (j < i) return (long long)x[i] - x[j] + c[i] + b[j];
  return (long long)x[j] - x[i] + d[i] + a[j];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n >> s >> e;
  for (int i = 1; i <= n; ++i) cin >> x[i];
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) cin >> b[i];
  for (int i = 1; i <= n; ++i) cin >> c[i];
  for (int i = 1; i <= n; ++i) cin >> d[i];
  arr[s] = e;
  sum = calc(s, e);
  for (int i = 1; i <= n; ++i) {
    if (i == s || i == e) continue;
    int p = s;
    long long cur = LLINF;
    for (int it = s; it != e; it = arr[it]) {
      long long tmp = calc(it, i) + calc(i, arr[it]) - calc(it, arr[it]);
      if (tmp < cur) cur = tmp, p = it;
    }
    arr[i] = arr[p];
    arr[p] = i;
    sum += cur;
  }
  cout << sum << endl;
  return 0;
}
