#include <bits/stdc++.h>
using namespace std;
int w[100010];
int leftSums[100010];
int rightSums[100010];
int main() {
  int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  int leftSum = 0, rightSum = 0;
  for (int i = 0; i < n; ++i) {
    cin >> w[i];
    rightSum += w[i];
  }
  int res = 2100000000;
  for (int left = 0; left <= n; ++left) {
    int right = n - left;
    int r1 = l * leftSum + rightSum * r;
    if (left <= right) {
      res = min(res, r1 + (right - left) * Qr);
      if (right > left) {
        res = min(res, r1 + (right - left - 1) * Qr);
      }
    } else {
      res = min(res, r1 + (left - right - 1) * Ql);
    }
    if (left != n) {
      leftSum += w[left];
      rightSum -= w[left];
    }
  }
  cout << res << endl;
  return 0;
}
