#include <bits/stdc++.h>
using namespace std;
long long n, s, e, x[5010], a[5010], b[5010], c[5010], d[5010];
long long sum = 0;
long long Next[5010];
long long distance(long long m, long long n) {
  if (x[m] > x[n]) return x[m] - x[n] + c[m] + b[n];
  return x[n] - x[m] + d[m] + a[n];
}
int main() {
  cin >> n >> s >> e;
  for (long long i = 1; i <= n; i++) cin >> x[i];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) cin >> b[i];
  for (long long i = 1; i <= n; i++) cin >> c[i];
  for (long long i = 1; i <= n; i++) cin >> d[i];
  sum = distance(s, e);
  Next[s] = e;
  long long maxm, best;
  for (long long i = 1; i <= n; i++) {
    if (i == s || i == e) continue;
    maxm = 1000000000000000;
    for (long long j = s; j != e; j = Next[j]) {
      long long k =
          distance(j, i) + distance(i, Next[j]) - distance(j, Next[j]);
      if (k < maxm) {
        maxm = k;
        best = j;
      }
    }
    sum += maxm;
    Next[i] = Next[best];
    Next[best] = i;
  }
  cout << sum;
  return 0;
}
