#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int T = 1;
  while (T--) {
    long long int n, l, r, ql, qr;
    cin >> n >> l >> r >> ql >> qr;
    vector<long long int> w, sum;
    for (long long int i = 0; i < n; i++) {
      long long int tmp;
      cin >> tmp;
      w.push_back(tmp);
    };
    long long int tmp = 0;
    for (long long int i = 0; i < n; i++) {
      tmp = tmp + w[i];
      sum.push_back(tmp);
    }
    long long int ans = 1000000007;
    for (long long int i = 0; i <= n; i++) {
      long long int left = i;
      long long int right = n - i;
      long long int req = min(left, right);
      long long int pen = n - req - req - 1;
      if (pen < 0) {
        pen = 0;
      }
      long long int cost = 0;
      if (left > 0) {
        cost += sum[left - 1] * l;
      }
      if (left > 0) {
        cost += (sum[n - 1] - sum[left - 1]) * r;
      } else {
        cost += sum[n - 1] * r;
      }
      if (left < right) {
        cost += pen * qr;
      } else {
        cost += pen * ql;
      }
      if (ans > cost) {
        ans = cost;
      }
    }
    cout << ans;
  }
  return 0;
}
