#include <bits/stdc++.h>
using namespace std;
const long long N = 5000, inf = 4 * 1e18;
long long n, s, e, x[N + 5], a[N + 5], b[N + 5], c[N + 5], d[N + 5],
    dp[N + 5][N + 5];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  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];
  memset(dp, 63, sizeof dp);
  dp[0][0] = 0;
  if (s != 1 && e != 1) dp[1][1] = b[1] + d[1] - 2 * x[1];
  if (s == 1) dp[1][1] = d[1] - x[1];
  if (e == 1) dp[1][1] = b[1] - x[1];
  for (long long i = 2; i <= n; ++i) {
    for (long long j = 1; j <= i + 1; ++j) {
      if (i == s) {
        if (i <= e || j > 1 || i == n)
          dp[i][j] = dp[i][j] < dp[i - 1][j] + c[i] + x[i]
                         ? dp[i][j]
                         : dp[i - 1][j] + c[i] + x[i];
        dp[i][j] = dp[i][j] < dp[i - 1][j - 1] + d[i] - x[i]
                       ? dp[i][j]
                       : dp[i - 1][j - 1] + d[i] - x[i];
      } else if (i == e) {
        if (i <= s || j > 1 || i == n)
          dp[i][j] = dp[i][j] < dp[i - 1][j] + a[i] + x[i]
                         ? dp[i][j]
                         : dp[i - 1][j] + a[i] + x[i];
        dp[i][j] = dp[i][j] < dp[i - 1][j - 1] + b[i] - x[i]
                       ? dp[i][j]
                       : dp[i - 1][j - 1] + b[i] - x[i];
      } else {
        if (i < s || j > 1)
          dp[i][j] = dp[i][j] = dp[i][j] < dp[i - 1][j] + b[i] + c[i]
                                    ? dp[i][j]
                                    : dp[i - 1][j] + b[i] + c[i];
        if (i < e || j > 1)
          dp[i][j] = dp[i][j] = dp[i][j] < dp[i - 1][j] + d[i] + a[i]
                                    ? dp[i][j]
                                    : dp[i - 1][j] + d[i] + a[i];
        dp[i][j] = dp[i][j] =
            dp[i][j] < dp[i - 1][j - 1] + b[i] + d[i] - 2 * x[i]
                ? dp[i][j]
                : dp[i - 1][j - 1] + b[i] + d[i] - 2 * x[i];
        if (j <= i - 1)
          if (i < s || i < e || j > 1 || i == n)
            dp[i][j] = dp[i][j] =
                dp[i][j] < dp[i - 1][j + 1] + a[i] + c[i] + 2 * x[i]
                    ? dp[i][j]
                    : dp[i - 1][j + 1] + a[i] + c[i] + 2 * x[i];
      }
    }
  }
  cout << dp[n][1];
  return 0;
}
