#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
  return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
template <typename S, typename T>
inline void Mum(S &a, const T &b) {
  a = 1LL * a * b % MOD;
}
template <typename T>
inline bool IsPri(T x) {
  if (x < 2) return false;
  for (T i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
template <typename T>
inline T Gcd(T a, T b) {
  while (b) {
    T t = b;
    b = a % b;
    a = t;
  }
  return a;
}
template <typename T>
inline int BitCnt(T x) {
  int cnt = 0;
  while (x) ++cnt, x &= x - 1;
  return cnt;
}
template <typename T>
inline T MDis(T x1, T y1, T x2, T y2) {
  return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T>
inline T MDis(T x1, T y1, T z1, T x2, T y2, T z2) {
  return abs(x1 - x2) + abs(y1 - y2) + abs(z1 - z2);
}
inline double EDis(double x1, double y1, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
inline double EDis(double x1, double y1, double z1, double x2, double y2,
                   double z2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) +
              (z1 - z2) * (z1 - z2));
}
inline long long Pow(long long a, long long n) {
  long long t = 1;
  a %= MOD;
  while (n > 0) {
    if (n & 1) t = t * a % MOD;
    a = a * a % MOD, n >>= 1;
  }
  return t % MOD;
}
inline int read() {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  register int x = false;
  register char ch =
      p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
          ? EOF
          : *p1++;
  ;
  register bool sgn = false;
  while (ch != '-' && (ch < '0' || ch > '9'))
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  if (ch == '-')
    sgn = true,
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48),
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  return sgn ? -x : x;
}
const int N = 2e6 + 100;
int a[N], p[N], b[N], c[N];
long long mx[N], mi[N];
vector<int> dz;
long long s[N];
int main() {
  memset((a), (-1), sizeof(a));
  int n, A, B, C, D, st, len;
  cin >> n >> A >> B >> C >> D >> st >> len;
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &p[i], &a[i]);
    dz.push_back(p[i]);
    if (p[i] - len + 1 >= 0) dz.push_back(p[i] - len + 1);
    dz.push_back(p[i] + 1);
    if (p[i] - len >= 0) dz.push_back(p[i] - len);
  }
  dz.push_back(0), dz.push_back(INT_MAX);
  (dz).push_back(INT_MIN), sort((dz).begin(), (dz).end()),
      (dz).erase(unique((dz).begin(), (dz).end()), (dz).end());
  int j = 1;
  for (int i = 1; i <= ((int)(dz).size()) - 2; ++i)
    if (j <= n && p[j] == dz[i]) {
      b[i] = (a[j] ? A : -B);
      c[i] = (a[j] ? C : -D);
      ++j;
    }
  n = ((int)(dz).size()) - 2;
  long long sum = 0;
  for (int i = n; i >= 1; --i) {
    sum = sum + b[i], mx[i] = max(mx[i + 1], sum);
    mi[i] = sum - mx[i];
  }
  sum = st;
  deque<int> dq;
  int last = 0;
  for (int i = 1; i <= n; ++i) {
    while (!dq.empty() && dq.front() < i) dq.pop_front();
    int j =
        upper_bound((dz).begin(), (dz).end(), dz[i] + len - 1) - dz.begin() - 1;
    while (last < j) {
      ++last;
      s[last] = s[last - 1] + c[last];
      while (!dq.empty() && s[dq.back()] > s[last]) dq.pop_back();
      dq.push_back(last);
    }
    if (sum + s[dq.front()] - s[i - 1] >= 0) printf("%d\n", dz[i]), exit(0);
    sum += b[i];
    if (sum < 0) cout << -1 << endl, exit(0);
  }
  return 0;
}
