#include <bits/stdc++.h>
using namespace std;
long long int w[500005];
long long int Left[500005];
long long int Right[500005];
int main() {
  ios_base::sync_with_stdio(false);
  long long int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
  }
  Left[0] = 0;
  for (int i = 0; i < n; i++) {
    Left[i + 1] = w[i] * l + Left[i];
  }
  Right[n] = 0;
  for (int i = n - 1; i >= 0; i--) {
    Right[i] = w[i] * r + Right[i + 1];
  }
  long long int ans = 1e18;
  for (int i = 0; i <= n; i++) {
    long long int temp = Left[i] + Right[i];
    if (i < n - i)
      temp += (n - i - i - 1) * Qr;
    else if (i > n - i)
      temp += (i - n + i - 1) * Ql;
    ans = min(ans, temp);
  }
  cout << ans << endl;
  return 0;
}
