#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t ll2;
typedef struct item * pitem;
#define rep(a, b) for(ll a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll2 INF=2e18+7;
const int LIM=2e5+7;
struct item {
pitem l=nullptr, r=nullptr;
ll2 a=0, b=INF;
};
ll2 dp[LIM], pref[LIM];
ll T[LIM], kiedy[LIM], x, n, m, w, t, N=1;
pair<ll,ll>P[LIM];
void upd(pitem &v, ll2 l, ll2 r, ll2 a, ll2 b) {
if(l==r) {
if(v->a*l+v->b>a*l+b) {
v->a=a;
v->b=b;
return;
}
}
if(a==0 && b==INF) return;
ll2 mid=(l+r-1)/2;
if(v->a*mid+v->b>a*mid+b) {
swap(v->a, a);
swap(v->b, b);
}
if(a<v->a) {
if(!v->r) v->r=new item();
upd(v->r, mid+1, r, a, b);
} else {
if(!v->l) v->l=new item();
upd(v->l, l, mid, a, b);
}
}
ll2 cnt(pitem &v, ll2 l, ll2 r, ll2 x) {
if(!v) return INF;
ll2 ans=v->a*x+v->b, mid=(l+r-1)/2;
if(l==r) return ans;
if(x<=mid) ans=min(ans, cnt(v->l, l, mid, x));
else ans=min(ans, cnt(v->r, mid+1, r, x));
return ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> x >> n >> m >> w >> t;
rep(i, 40) N*=2;
pitem root=new item();
rep(i, n) cin >> T[i];
T[n]=x; ++n;
rep(i, m) cin >> P[i].st >> P[i].nd;
sort(T, T+n);
sort(P, P+m);
rep(i, m) {
kiedy[i]=INF;
pref[i]=P[i].nd;
if(i) pref[i]+=pref[i-1];
}
rep(i, n) {
ll po=0, ko=m-1;
while(po<ko) {
ll sr=(po+ko+1)/2;
if(P[sr].st>T[i]%t) ko=sr-1; else po=sr;
}
if(P[po].st>T[i]%t) continue;
kiedy[po]=min(kiedy[po], T[i]/t);
}
rep(i, m) {
ll ile=w*(x/t);
if(x%t>P[i].st) ile+=w;
dp[i]=ile;
if(i) dp[i]+=dp[i-1];
if(kiedy[i]!=INF) {
dp[i]=min(dp[i], pref[i]+i*kiedy[i]*w+cnt(root, -N+1, 0, -kiedy[i]));
dp[i]=min(dp[i], pref[i]+(i+1)*kiedy[i]*w);
}
upd(root, -N+1, 0, i*w, dp[i]-pref[i]);
}
cout << (ll)(dp[m-1])+w*(x/t+1) << '\n';
}
