#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void write(T x) {
  int i = 20;
  char buf[21];
  buf[20] = '\n';
  do {
    buf[--i] = x % 10 + '0';
    x /= 10;
  } while (x);
  do {
    putchar(buf[i]);
  } while (buf[i++] != '\n');
}
template <typename T>
inline T readInt() {
  T n = 0, s = 1;
  char p = getchar();
  if (p == '-') s = -1;
  while ((p < '0' || p > '9') && p != EOF && p != '-') p = getchar();
  if (p == '-') s = -1, p = getchar();
  while (p >= '0' && p <= '9') {
    n = (n << 3) + (n << 1) + (p - '0');
    p = getchar();
  }
  return n * s;
}
int main() {
  long long n = readInt<long long>(), l = readInt<long long>(),
            r = readInt<long long>(), ql = readInt<long long>(),
            qr = readInt<long long>();
  long long a[n + 10];
  a[0] = a[n + 1] = 0;
  for (int i = 1; i <= n; i++) a[i] = readInt<long long>() + a[i - 1];
  long long ans = min(a[n] * l + (n - 1) * ql, a[n] * r + (n - 1) * qr);
  for (int i = 1; i < n; i++) {
    long long cur = a[i] * l + (a[n] - a[i]) * r;
    if (i < n - i)
      cur += qr * (max(abs(n - i - i) - 1, (long long)0));
    else
      cur += ql * (max(abs(n - i - i) - 1, (long long)0));
    ans = min(ans, cur);
  }
  cout << ans;
  return 0;
}
