#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr, w[100009], s1[100009], s2[100009];
int f(int x, int y) {
  if (x == y) return 0;
  if (x > y) return ql * (x - y - 1);
  return qr * (y - x - 1);
}
int main() {
  int ans = 0;
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  s1[0] = 0;
  s2[n + 1] = 0;
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]), s1[i] = s1[i - 1] + w[i] * l;
  for (int i = n; i >= 1; i--) s2[i] = s2[i + 1] + w[i] * r;
  ans = s2[1] + qr * (n - 1);
  for (int i = 1; i <= n; i++) {
    int ans1 = s1[i] + s2[i + 1] + f(i, n - i);
    ans = min(ans, ans1);
  }
  printf("%d\n", ans);
}
