#include <bits/stdc++.h>
using namespace std;
int w[100001];
int main() {
  int n, l, r, ql, qr;
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", w + i);
    w[i] += w[i - 1];
  }
  long long res = 1ll << 60, cur;
  for (int i = 0, L, R; i <= n; ++i) {
    cur = (long long)w[i] * l + (long long)(w[n] - w[i]) * r;
    L = i;
    R = n - i;
    if (L > R)
      cur += max(L - R - 1, 0) * ql;
    else
      cur += max(R - L - 1, 0) * qr;
    res = min(res, cur);
  }
  printf("%lld", res);
  return 0;
}
