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