#include <bits/stdc++.h>
using namespace std;
int w[100007], s[100007];
int main() {
  int sm, d, k, i, ql, qr, c, n, m, ans, t, l, nr, r;
  cin >> n >> l >> r >> ql >> qr;
  for (i = 1; i <= n; i++) cin >> w[i];
  s[0] = 0;
  for (i = 1; i <= n; i++) s[i] = s[i - 1] + w[i];
  ans = 1100000000;
  for (int nl = 0; nl <= n; nl++) {
    nr = n - nl;
    sm = r * (s[n] - s[nl]) + l * s[nl];
    if (nl - nr > 1) sm += ql * (nl - nr - 1);
    if (nr - nl > 1) sm += qr * (nr - nl - 1);
    if (sm < ans) ans = sm;
  }
  cout << ans << endl;
  return 0;
}
