#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, ql, qr, i;
  cin >> n >> l >> r >> ql >> qr;
  int w[n], left[n], right[n];
  for (i = 0; i < n; i++) {
    cin >> w[i];
  }
  left[0] = w[0] * l;
  for (i = 1; i < n; i++) {
    left[i] = w[i] * l + left[i - 1];
  }
  right[n - 1] = w[n - 1] * r;
  for (i = n - 2; i >= 0; i--) {
    right[i] = right[i + 1] + (w[i] * r);
  }
  int sum = 0,
      minimum = min(right[0] + (qr * (n - 1)), left[n - 1] + (ql * (n - 1))),
      leftcount = 0, rightcount = n;
  for (i = 0; i < n - 1; i++) {
    leftcount++;
    rightcount--;
    sum = left[i] + right[i + 1];
    if (leftcount < rightcount) {
      sum += (rightcount - leftcount - 1) * qr;
    } else if (leftcount > rightcount) {
      sum += (leftcount - rightcount - 1) * ql;
    }
    minimum = min(minimum, sum);
  }
  cout << minimum;
  return 0;
}
