// Skyqwq
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define fi first
#define se second
#define pb push_back

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> void inline read(T &x) {
	x = 0; int f = 1; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
	while (s >= '0' && s <= '9') x = x * 10 + (s ^ 48), s = getchar();
	x *= f;
}

template <typename T> void inline chkMin(T &x, T y) { if (y < x) x = y; }
template <typename T> void inline chkMax(T &x, T y) { if (y > x) x = y; }

const int N = 2e5 + 5;
const LL INF = 0x3f3f3f3f3f3f3f3f;

LL X, T, W, s[N], ans, cnt[N], f[N], sc[N];

int n, m;

struct E{
	LL d, c;
	bool operator < (const E &b) const {
		if (d == b.d) return c < b.c; 
		return d < b.d;
	}
} e[N];

int inline Lw(LL x) {
	return lower_bound(e + 1, e + 1 + m, (E) { x, 0 }) - e;
}

LL inline get(LL t) {
	return (X - t) / T + 1;
}

int q[N], top;

LL x[N], y[N];

long double inline K(int i, int j) {
	return ((long double)y[j] - y[i]) / (x[j] - x[i]);
}

void inline upd(int i, int j) {
	chkMin(f[i], f[j] + W * cnt[i] * (i - j) + sc[i] - sc[j]);
}

int main() {
	read(X), read(n), read(m), read(W), read(T);
	for (int i = 1; i <= n; i++) read(s[i]);
	for (int i = 1; i <= m; i++) read(e[i].d), read(e[i].c);
	memset(cnt, 0x3f, sizeof cnt);
	sort(s + 1, s + 1 + n);
	s[n + 1] = X;
	sort(e + 1, e + 1 + m);
	for (int i = 1; i <= m; i++) sc[i] = sc[i - 1] + e[i].c;
	for (int i = 1; i <= n + 1; i++) {
		int p = Lw(s[i] % T) - 1;
		if (p) chkMin(cnt[p], s[i] / T);
	}
	memset(f, 0x3f, sizeof f);
	f[0] = 0;
	top = 1;
	for (int i = 1; i <= m; i++) {
		f[i] = f[i - 1] + W * get(e[i].d);
		if (cnt[i] != INF) {
			int l = 1, r = top - 1;
			upd(i, q[top]);
			while (l < r) {
				int mid = (l + r) >> 1;
				if (K(q[mid], q[mid + 1]) > W * cnt[i]) r = mid;
				else l = mid + 1;
			}
			upd(i, q[l]);
		}
		x[i] = i, y[i] = f[i] - sc[i];
		while (top > 1 && K(q[top], q[top - 1]) >= K(q[top], i)) top--;
		q[++top] = i;
	}
	printf("%lld\n", f[m] + W * get(0)); 
}