#include <bits/stdc++.h>
using namespace std;
int sum[100005], temp;
int main() {
  int n, l, r, ql, qr, i;
  while (scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr) != EOF) {
    sum[0] = 0;
    for (i = 1; i <= n; i++) {
      scanf("%d", &temp);
      sum[i] = sum[i - 1] + temp;
    }
    int ans = 0, minn = 1000000000;
    for (i = 0; i <= n; i++) {
      ans = l * sum[i] + r * (sum[n] - sum[i]);
      if (i < n - i) {
        ans += qr * (n - 2 * i - 1);
      } else if (i > n - i) {
        ans += ql * (2 * i - n - 1);
      } else
        ;
      if (ans < minn) minn = ans;
    }
    printf("%d\n", minn);
  }
  return 0;
}
