#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  vector<int> W(n);
  for (int &w : W) cin >> w;
  int leftsum = 0, rightsum = 0;
  for (int w : W) rightsum += w;
  int ans = INT_MAX;
  for (int L = 0, R = n; L <= n; ++L, --R) {
    int opt = l * leftsum + r * rightsum;
    if (L > R)
      opt += Ql * (L - R - 1);
    else if (L < R)
      opt += Qr * (R - L - 1);
    ans = min(opt, ans);
    if (L != n) {
      leftsum += W[L];
      rightsum -= W[L];
    }
  }
  cout << ans;
  return 0;
}
