#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
int n, l, r, ql, qr;
int w[100000];
int sum[100000];
int curr;
int ans;
bool lr;
int main() {
  cin >> n;
  cin >> l >> r;
  cin >> ql >> qr;
  for (int i = 0; i < n; i++) cin >> w[i], sum[i + 1] = sum[i] + w[i];
  ans = INF;
  sum[0] = 0;
  for (int i = 0; i <= n; i++) {
    curr = sum[i] * l + (sum[n] - sum[i]) * r;
    if (i > n - i) curr += (2 * i - n - 1) * ql;
    if (i < n - i) curr += (n - 2 * i - 1) * qr;
    ans = min(ans, curr);
  }
  cout << ans;
  return 0;
}
