#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  int arr[n + 1];
  for (int i = 1; i <= n; ++i) cin >> arr[i];
  int pre[n + 1];
  pre[1] = arr[1];
  for (int i = 2; i <= n; ++i) pre[i] = pre[i - 1] + arr[i];
  int suff[n + 1];
  suff[n] = 0;
  suff[n] = arr[n];
  for (int i = n - 1; i > 0; --i) suff[i] = suff[i + 1] + arr[i];
  int a = INT_MAX;
  a = min(pre[n] * l + (n - 1) * Ql, pre[n] * r + (n - 1) * Qr);
  for (int i = 1; i < n; ++i) {
    int current = pre[i] * l + (suff[i + 1]) * r;
    if (i > n - i) {
      current += Ql * (2 * i - n - 1);
    } else if (n - i > i) {
      current += Qr * (n - 2 * i - 1);
    }
    a = min(a, current);
  }
  cout << a << '\n';
}
