#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<int> w(n);
  for (int i = 0; i < n; i++) scanf("%d", &w[i]);
  vector<long long> A(n + 1, 0), B(n + 1, 0);
  for (int i = 1; i <= n; i++) A[i] = A[i - 1] + (long long)w[i - 1] * l;
  for (int i = 1; i <= n; i++) B[i] = B[i - 1] + (long long)w[i - 1] * r;
  long long gans = LLONG_MAX;
  for (int L = 0; L <= n; L++) {
    int R = n - L;
    long long sum = 0;
    sum += A[L];
    sum += (B[n] - B[L]);
    if (L > R) {
      sum += (L - R - 1) * ql;
    } else if (R > L)
      sum += (R - L - 1) * qr;
    if (0) cout << sum << endl;
    gans = min(gans, sum);
  }
  cout << gans << endl;
}
