#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int w[MAXN];
int s[MAXN];
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) {
    cin >> w[i];
    s[i] = w[i] + s[i - 1];
  }
  int res = (1 << 31) - 1;
  for (int i = 0; i <= n; i++) {
    int cur = l * s[i] + r * (s[n] - s[i]);
    if (n - 2 * i - 1 > 0) {
      cur += qr * (n - 2 * i - 1);
    }
    if (2 * i - n - 1 > 0) {
      cur += ql * (2 * i - n - 1);
    }
    res = min(res, cur);
  }
  cout << res << endl;
}
