#include <bits/stdc++.h>
using namespace std;
long long n, l, r, ql, qr;
long long w[100005];
long long sum[100005] = {0};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) {
    cin >> w[i];
    sum[i] = sum[i - 1] + w[i];
  }
  if (l == r) {
    cout << sum[n] * l << "\n";
    return 0;
  }
  long long ans = 1e19;
  for (int i = 0; i <= n; i++) {
    long long left = (sum[i] - sum[0]) * l;
    long long right = (sum[n] - sum[i]) * r;
    long long ln = i, rn = n - i;
    long long off = 0;
    if (ln > rn) off = (ln - rn - 1) * ql;
    if (ln < rn) off = (rn - ln - 1) * qr;
    ans = min(ans, left + right + off);
  }
  cout << ans << "\n";
}
