#include <bits/stdc++.h>
using namespace std;
int n, m, t, l, r, ql, qr;
int w[100010], ls[100010] = {0};
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; i++) scanf("%d", &w[i]);
  for (int i = 0; i < n; i++) {
    if (i)
      ls[i] = ls[i - 1] + w[i];
    else
      ls[i] = w[i];
  }
  long long ans = 1LL << 60;
  for (int i = 0; i <= n; i++) {
    int L = i, R = n - i;
    long long tmp;
    if (!i)
      tmp = r * ls[n - i - 1];
    else if (i == n)
      tmp = l * ls[i - 1];
    else
      tmp = l * ls[i - 1] + r * (ls[n - 1] - ls[i - 1]);
    if (R > L) tmp += (R - L - 1) * qr;
    if (L > R) tmp += (L - R - 1) * ql;
    ans = min(ans, tmp);
  }
  printf("%I64d\n", ans);
  return 0;
}
