#include <bits/stdc++.h>
using namespace std;
long long int prod(long long int a, long long int b) {
  long long int x, d;
  if (b == 0)
    return 1;
  else {
    d = prod(a, b / 2);
    x = (d * d) % 1000000007;
    if (b % 2 == 0)
      return x;
    else
      return (x * (a % 1000000007)) % 1000000007;
  }
}
int main() {
  long long int n, l, r, ql, qr, sum[100005], i, a[100005], ans;
  scanf("%lld", &n), scanf("%lld", &l), scanf("%lld", &r), scanf("%lld", &ql),
      scanf("%lld", &qr);
  sum[0] = 0;
  for (i = 1; i < n + 1; i++) {
    scanf("%lld", &a[i]);
    sum[i] = sum[i - 1] + a[i];
  }
  ans = 10000000000000009;
  for (i = 2; i < n + 1; i++) {
    long long int left = i - 1;
    long long int right = n - i + 1;
    long long int e = 0;
    if (left > right)
      e = (left - right - 1) * ql;
    else if (left != right)
      e = (right - left - 1) * qr;
    ans = min(ans, (sum[i - 1] * l) + (sum[n] - sum[i - 1]) * r + e);
  }
  ans = min(ans, sum[n] * r + (n - 1) * qr);
  ans = min(ans, sum[n] * l + (n - 1) * ql);
  printf("%lld\n", ans);
  return 0;
}
