#include <bits/stdc++.h>
using namespace std;
int gi() {
  int x = 0, w = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') w = 0, ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return w ? x : -x;
}
const int N = 1e5 + 5;
int n, c, d, a[N];
char b[N];
long long sum, ans;
int main() {
  n = gi();
  c = gi();
  d = gi();
  ans = 1ll * n * d;
  for (int i = 1; i <= n; ++i) a[i] = gi(), b[i] = getchar();
  a[n + 1] = gi();
  for (int i = n, lst; i; --i) {
    if (b[i] == b[i + 1])
      sum += min(d, (lst - a[i + 1]) * c);
    else
      lst = a[i + 1];
    ans = min(ans, 1ll * (a[n + 1] - a[i]) * c + sum + 1ll * (i - 1) * d);
  }
  cout << ans;
  return 0;
}
