#include <bits/stdc++.h>
using namespace std;
int w[100010];
int sumF[100010];
int sumL[100010];
int main() {
  int n, l, r, Ql, Qr, x, y;
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 1; i <= n; i++) cin >> w[i];
  for (int i = 1; i <= n; i++) sumF[i] = sumF[i - 1] + w[i];
  for (int i = 1; i <= n; i++) sumL[i] = sumL[i - 1] + w[n - i + 1];
  int ans = 1000000000;
  for (int i = 0; i <= n; i++) {
    int sum = sumF[i] * l + sumL[n - i] * r;
    if (i < n - i) sum += Qr * (n - i - i - 1);
    if (i > n - i) sum += Ql * (i - n + i - 1);
    ans = min(ans, sum);
  }
  cout << ans << endl;
  return 0;
}
