#include <bits/stdc++.h>
using namespace std;
int const maxN = 200000;
long long oo = 100000000000000;
long long n, l, r, ql, qr;
long long a[maxN], s[maxN];
int main() {
  ios ::sync_with_stdio(false);
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    s[i] = s[i - 1] + a[i];
  }
  long long res = oo;
  for (int i = 0; i <= n; i++) {
    long long ans = 0;
    long long numl = i;
    long long numr = n - i;
    ans = s[numl] * l + (s[n] - s[i]) * r;
    long long diff = abs(numl - numr) - 1;
    if (diff > 0)
      if (numl > numr)
        ans += diff * ql;
      else
        ans += diff * qr;
    if (ans < res) res = ans;
  }
  cout << res;
  return 0;
}
