#include <cstdio> 
#include <algorithm> 
#include <vector>
#include <cstring>

using namespace std; 

typedef long long ll; 

const int N = 2010;

int n, m;
ll s[N], d[N], c[N], t, w;
int fst[N], ind[N]; // -1
			
ll dp[N];

int main() { 
	ll X;
	scanf("%lld%d%d%lld%lld", &X, &n, &m, &w, &t);
	s[n + 1] = X;
	for(int i = 1; i <= n; ++i) { scanf("%lld", s + i); }

	ll sum = (X / t + 1LL) * w;
	for(int i = 0; i < m; ++i) { 
		scanf("%lld%lld", d + i, c + i); 
		sum += c[i];
		ind[i] = i;
	}

	sort(ind, ind + m, [](ll a, ll b) { 
		return d[a] < d[b];
	});
	sort(s, s + n + 2, [](ll a, ll b) { 
		return a < b;
	});

	memset(fst, -1, sizeof(fst));
	for(int j = m - 1; j >= 0; --j) { 
		int x = ind[j];
		dp[j] = dp[j + 1] - c[x] + ((X - d[x]) / t + 1LL) * w;
		for(int i = 1; i <= n + 1; ++i) { 
			ll k = (s[i] - d[x]) / t;
			if(d[x] + k * t > s[i - 1] && (k + 1LL) * t > s[i]) { 
				if(fst[i] == -1) { fst[i] = j; }
				dp[j] = min(dp[j], dp[fst[i] + 1] + (ll) k * w * (ll) (fst[i] - j + 1));
			}
		}
	}
	
	printf("%lld\n", sum + dp[0]);
	return 0;
}