#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<int> ws(n);
  for (auto &w : ws) {
    cin >> w;
  }
  int res = INT_MAX, twl = 0, twr = accumulate((ws).begin(), (ws).end(), 0);
  for (int i = (int)(0); i < (int)(n + 1); ++i) {
    const int L = i, R = n - L;
    int tmp = twl * l + twr * r;
    if (L + 1 < R) {
      tmp += (R - L - 1) * qr;
    } else if (R + 1 < L) {
      tmp += (L - R - 1) * ql;
    }
    res = min(res, tmp);
    if (i < n) {
      twl += ws[i];
      twr -= ws[i];
    }
  }
  cout << res << endl;
  return 0;
}
