#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
long long aa[N + 2], qm[N + 2], mq[N + 2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (long long i = 1; i <= n; i++) cin >> aa[i];
  for (long long i = 1; i <= n; i++) qm[i] = qm[i - 1] + aa[i] * l;
  for (long long i = n; i >= 1; i--) mq[i] = mq[i + 1] + aa[i] * r;
  long long ans = 1e18;
  for (long long i = 0; i <= n; i++) {
    long long lt = i, rt = n - i, rm;
    if (lt == rt) {
      ans = min(ans, qm[i] + mq[i + 1]);
    } else if (lt > rt) {
      rm = lt - 1 - rt;
      ans = min(ans, qm[i] + mq[i + 1] + ql * rm);
    } else {
      rm = rt - 1 - lt;
      ans = min(ans, qm[i] + mq[i + 1] + qr * rm);
    }
  }
  cout << ans << endl;
  return 0;
}
