#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 2007;
int l[N][N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int x, n, m, w, t;
cin >> x >> n >> m >> w >> t;
//first - d, second - c
vector <int> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
sort(all(s));
s.app(x);
vector <ii> a(m);
for (int i = 0; i < m; ++i)
cin >> a[i].f >> a[i].s;
sort(all(a));
reverse(all(a));
a.insert(a.begin(), mp(0, 0));
auto getcnt = [&](int x, int d) {
//d + k * t <= x
//k * t <= x - d
if (x < d)
return 0ll;
int k = (x-d)/t;
return k + 1;
};
auto get = [&](int i, int j) {
int di = a[i].f;
int dj = a[j%a.size()].f;
if (l[i][j] != -1) {
int p = l[i][j];
if (getcnt(s[p], dj) > getcnt(s[p], di) || (getcnt(s[p], dj) == getcnt(s[p], di) && dj > di)) {
return a[j].s + (getcnt(s[p], dj)-1)*w;
}
}
return -1ll;
};
auto save = [&](int i) {
if (i == a.size())
return 0ll;
int cnt = x/t+(a[i].f<=(x%t));
return cnt * w;
};
vector <int> last(s.size()), mem(a.size(), s.size());
for (int i = 0; i < s.size(); ++i) {
last[i] = 0;
for (int j = 1; j < a.size(); ++j) {
if (getcnt(s[i], a[j].f) > getcnt(s[i], a[last[i]].f) || (getcnt(s[i], a[j].f) == getcnt(s[i], a[last[i]].f) && a[j].f > a[last[i]].f)) {
last[i] = j;
}
}
mem[last[i]] = min(mem[last[i]], i);
}
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
l[i][j] = -1;
for (int i = 0; i < a.size(); ++i) {
for (int j = i + 1; j < a.size(); ++j) {
int lf = l[i][j-1];
if (mem[j] != -1) {
if (lf == -1)
lf = mem[j];
else
lf = min(lf, mem[j]);
}
l[i][j] = lf;
}
}
vector <int> dp(a.size()+1, -1);
dp[0] = (x/t+1)*w;
for (int i = 0; i < a.size(); ++i) {
int cur = 0;
for (int j = i + 1; j <= a.size(); ++j) {
if (j > i + 1) {
int add = get(i, j - 1);
if (add == -1)
break;
cur += add;
}
if (dp[j] == -1) {
dp[j] = dp[i]+cur+save(j);
}
else {
dp[j] = min(dp[j], dp[i]+cur+save(j));
}
}
}
cout << (int)dp[a.size()] << endl;
}
