#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
const long long inf = 10000000009;
int n, s, e;
vector<int> x(maxn), a(maxn), b(maxn), c(maxn), d(maxn), used(maxn);
long long ccc(int i, int j) {
  long long res = abs((long long)x[i] - (long long)x[j]);
  if (j < i) res += (long long)c[i] + (long long)b[j];
  if (j > i) res += (long long)d[i] + (long long)a[j];
  return res;
}
long long sss(int s, int e) {
  long long time = ccc(s, e);
  used[s] = e;
  for (int i = 0; i < n; ++i) {
    if (i != s && i != e) {
      long long cur_time = inf;
      int cur_pos = -1;
      for (int j = s; j != e; j = used[j]) {
        long long tmp = ccc(j, i) - ccc(j, used[j]) + ccc(i, used[j]);
        if (tmp < cur_time) {
          cur_time = tmp;
          cur_pos = j;
        }
      }
      time += cur_time;
      used[i] = used[cur_pos];
      used[cur_pos] = i;
    }
  }
  return time;
}
int main() {
  cin >> n >> s >> e;
  s--;
  e--;
  for (int i = 0; i < n; ++i) cin >> x[i];
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  for (int i = 0; i < n; ++i) cin >> c[i];
  for (int i = 0; i < n; ++i) cin >> d[i];
  cout << sss(s, e) << endl;
  return 0;
}
