#include <bits/stdc++.h>
using namespace std;
const int nval = 4 * (1000 * 1000 + 3 * 100);
const double eps = 1e-6;
const long long inf = 1000000000 * 1ll * 1000000000;
int main() {
  long long n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<long long> w(n), presum(n + 1);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
    sum += w[i];
    presum[i + 1] = presum[i] + w[i];
  }
  long long ans = inf;
  for (int i = 0; i <= n; i++) {
    long long lsum = presum[i] * l;
    long long rsum = (sum - presum[i]) * r;
    long long j = n - i;
    long long result = lsum + rsum;
    if (i > j) {
      long long diff = i - j;
      if (diff >= 1) diff--;
      result += diff * ql;
    } else {
      long long diff = j - i;
      if (diff >= 1) diff--;
      result += diff * qr;
    }
    if (result < ans) ans = result;
  }
  cout << ans << endl;
  return 0;
}
