#include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 100100;
long long int l, r, ql, qr;
long long int a[maxn];
long long int dp[maxn][2];
long long int sum[maxn];
long long int ans = (long long int)(1e14);
long long int calc(long long int ind) {
  long long int ind1 = n - 2 - ind;
  if (ind < ind1)
    ind++;
  else if (ind > ind1)
    ind1++;
  if (ind < ind1) {
    return (ind1 - ind) * qr;
  } else {
    return (ind - ind1) * ql;
  }
}
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    long long int ds = 0;
    if (i > 0) {
      ds = sum[i - 1];
    }
    sum[i] += ds + a[i];
  }
  ans = min(ans, sum[n - 1] * r + ((n - 1) * qr));
  for (int i = 0; i < n; i++) {
    ans = min(ans, sum[i] * l + (sum[n - 1] - sum[i]) * r + calc(i));
  }
  cout << ans << endl;
  return 0;
}
