#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const int N = 1E5 + 5;
long long n, l, r, ql, qr;
long long arr[N], pre[N];
int main() {
  fast();
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 1; i <= n; ++i) {
    pre[i] = arr[i] + pre[i - 1];
  }
  long long mini =
      min(pre[n] * l + (ql * (n - 1)), pre[n] * r + (qr * (n - 1)));
  for (int i = 1; i <= n; ++i) {
    long long x = (pre[i] * l) + ((pre[n] - pre[i]) * r);
    int takenL = i, takenR = n - i;
    if (takenL < takenR) {
      x += (takenR - takenL - 1) * qr;
    } else if (takenR < takenL)
      x += (takenL - takenR - 1) * ql;
    mini = min(mini, x);
  }
  cout << mini << "\n";
}
