#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define int ll
const int N = 2e5 + 10;
const ll BINF = 1e18 + 10;
int can[N], dp[N], f[N], cost[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x, n, m, w, t;
cin >> x >> n >> m >> w >> t;
vector<int> s(n);
for (auto &it : s) {
cin >> it;
}
sort(all(s));
vector<pair<int, int>> srt;
for (int i = 1; i <= m; i++) {
cin >> f[i] >> cost[i];
srt.pb({f[i], i});
}
sort(all(srt));
for (int i = 0; i <= m; i++) {
can[i] = BINF;
}
for (auto it : s) {
int ps = lower_bound(all(srt), make_pair(it % t, 0ll)) - srt.begin();
if (ps + 1 <= m) {
can[ps + 1] = min(can[ps + 1], it / t);
}
else {
can[0] = min(can[0], it / t);
}
}
int ps = lower_bound(all(srt), make_pair(x % t, 0ll)) - srt.begin();
if (ps + 1 <= m) {
can[ps + 1] = min(can[ps + 1], x / t);
}
else {
can[0] = min(can[0], x / t);
}
dp[0] = w * (x / t + 1);
for (int i = 1; i <= m; i++) {
int cnt = x / t;
if (f[srt[i - 1].S] < x % t) {
cnt++;
}
dp[i] = dp[i - 1] + w * cnt;
if (can[i] < BINF) {
int sum = 0, cl = can[i];
for (int lst = i - 2; lst >= 0; lst--) {
sum += w * cl + cost[srt[lst].S];
cl = min(cl, can[lst + 1]);
dp[i] = min(dp[i], dp[lst] + sum + w * cnt);
}
}
}
int ans = dp[m];
if (can[0] < BINF) {
int sum = 0, cl = can[0];
for (int lst = m - 1; lst >= 0; lst--) {
sum += w * cl + cost[srt[lst].S];
cl = min(cl, can[lst + 1]);
ans = min(ans, sum + dp[lst]);
}
}
cout << ans << '\n';
}
