#include <bits/stdc++.h>
using namespace std;
int arr[100005];
int psum[100005];
int main() {
  int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    psum[i + 1] = psum[i] + arr[i];
  }
  int ret = INT_MAX;
  for (int i = 0; i <= n; i++) {
    int curr = psum[i] * l + (psum[n] - psum[i]) * r;
    if (i > n - i) curr = curr + (i + i - n - 1) * Ql;
    if (i < n - i) curr = curr + (n - 2 * i - 1) * Qr;
    ret = min(ret, curr);
  }
  cout << ret;
}
