#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
inline void getint(int &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
inline void print(int first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int first[5050], a[5050], b[5050], c[5050], d[5050];
long long dp[5050][5050];
void get(int *a, int n) {
  for (int i = 0; i < n; i++) scanf("%d", a + i);
}
int main() {
  int n, s, e;
  cin >> n >> s >> e;
  get(first, n);
  get(a, n);
  get(b, n);
  get(c, n);
  get(d, n);
  s--, e--;
  int vs = (s == 0);
  int ve = (e == 0);
  memset(dp, 0x3f, sizeof(dp));
  if (vs)
    dp[0][1] = d[0];
  else if (ve)
    dp[0][1] = b[0];
  else
    dp[0][2] = b[0] + d[0];
  for (int i = 1; i < n; i++) {
    for (int j = 2 - (vs ^ ve); j < n; j += 2) {
      if (dp[i - 1][j] == 0x3f3f3f3f3f3f3f3fLL) continue;
      dp[i - 1][j] += (long long)j * (first[i] - first[i - 1]);
      long long v = dp[i - 1][j];
      if (i == s) {
        smin(dp[i][j - 1], v + c[i]);
        smin(dp[i][j + 1], v + d[i]);
      } else if (i == e) {
        smin(dp[i][j - 1], v + a[i]);
        smin(dp[i][j + 1], v + b[i]);
      } else {
        if (j > 1)
          smin(dp[i][j], v + min(a[i] + d[i], b[i] + c[i]));
        else if (vs)
          smin(dp[i][j], v + a[i] + d[i]);
        else if (ve)
          smin(dp[i][j], v + b[i] + c[i]);
        if (j >= 2) smin(dp[i][j - 2], v + a[i] + c[i]);
        smin(dp[i][j + 2], v + b[i] + d[i]);
      }
    }
    if (i == s) vs = 1;
    if (i == e) ve = 1;
  }
  cout << dp[n - 1][0] << endl;
  return 0;
}
