#include <bits/stdc++.h>
using namespace std;
long long dp[5010][5010];
long long a[5010], b[5010], c[5010], d[5010], x[5010];
int main() {
  int n, i, j, s, e, f1 = 0, f2 = 0;
  scanf("%d", &n);
  scanf("%d", &s);
  scanf("%d", &e);
  x[0] = 0;
  for (i = 1; i <= n; ++i) scanf("%lld", &x[i]);
  for (i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  for (i = 1; i <= n; ++i) scanf("%lld", &b[i]);
  for (i = 1; i <= n; ++i) scanf("%lld", &c[i]);
  for (i = 1; i <= n; ++i) scanf("%lld", &d[i]);
  for (i = 0; i <= n; ++i)
    for (j = 0; j <= n; ++j) dp[i][j] = 1e18;
  dp[0][0] = 0;
  for (i = 1; i < n; ++i) {
    for (j = 0; j <= n; ++j) {
      if (i == s) {
        dp[i][j] =
            min(dp[i][j],
                dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + d[i]);
        if (j)
          dp[i][j - 1] =
              min(dp[i][j - 1],
                  dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + c[i]);
        continue;
      }
      if (i == e) {
        dp[i][j] =
            min(dp[i][j],
                dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + b[i]);
        if (j)
          dp[i][j - 1] =
              min(dp[i][j - 1],
                  dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + a[i]);
        continue;
      }
      dp[i][j + 1] = min(
          dp[i][j + 1],
          dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + b[i] + d[i]);
      if (j || f2)
        dp[i][j] =
            min(dp[i][j], dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) +
                              b[i] + c[i]);
      if (j || f1)
        dp[i][j] =
            min(dp[i][j], dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) +
                              a[i] + d[i]);
      if (j >= 2 || j && f1 || j && f2)
        dp[i][j - 1] = min(
            dp[i][j - 1],
            dp[i - 1][j] + (x[i] - x[i - 1]) * (2 * j + f1 + f2) + a[i] + c[i]);
    }
    if (i == s) f1++;
    if (i == e) f2++;
  }
  if (n == s)
    dp[n][0] = min(dp[n][0], dp[n - 1][0] + x[n] - x[n - 1] + c[n]);
  else if (n == e)
    dp[n][0] = min(dp[n][0], dp[n - 1][0] + x[n] - x[n - 1] + a[n]);
  else
    dp[n][0] =
        min(dp[n][0], dp[n - 1][0] + 2 * (x[n] - x[n - 1]) + a[n] + c[n]);
  printf("%lld\n", dp[n][0]);
}
