#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'
#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll l,n,m,w,k;
ll dist[200005];
ii arr[200005];
ll pref[200005];
vector<ii> trans[200005];
ll memo[200005];
struct line{
ll m,c;
ll eval(ll x){
return m*x+c;
}
};
struct hull{
vector<line> stk;
#define ld long double
ld POI(line i,line j){
return (ld)(i.c-j.c)/(ld)(j.m-i.m);
}
void add(line i){
while (sz(stk)>=2 &&
POI(stk[sz(stk)-2],stk[sz(stk)-1])>POI(stk[sz(stk)-1],i)) stk.pob();
stk.pub(i);
}
ll eval(ll x){
int lo=0,hi=sz(stk)-1,mi;
while (hi>lo){
mi=hi+lo>>1;
if (x<POI(stk[mi],stk[mi+1])) hi=mi;
else lo=mi+1;
}
return stk[lo].eval(x);
}
};
struct node{
int s,e,m;
hull val;
node *l,*r;
node (int _s,int _e){
s=_s,e=_e,m=s+e>>1;
if (s!=e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void update(int i,line k){
val.add(k);
if (s==e) return;
if (i<=m) l->update(i,k);
else r->update(i,k);
}
ll query(int i,int j,ll x){
if (s==i && e==j) return val.eval(x);
else if (j<=m) return l->query(i,j,x);
else if (m<i) return r->query(i,j,x);
else return min(l->query(i,m,x),r->query(m+1,j,x));
}
} *root=new node(0,200005);
int main(){
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(false);
cin>>l>>n>>m>>w>>k;
rep(x,1,n+1) cin>>dist[x];
dist[n+1]=l;
sort(dist,dist+n+2);
rep(x,0,m) cin>>arr[x].fi>>arr[x].se;
sort(arr,arr+m);
arr[m]=ii(1e9,1e9);
rep(x,0,m) pref[x+1]=pref[x]+arr[x].se;
rep(x,0,n+1){
//cout<<dist[x]<<" "<<dist[x+1]<<endl;
int l,r;
if ((dist[x]/k+1)*k<=dist[x+1]) l=0;
else l=lb(arr,arr+m,ii(dist[x]%k,-1))-arr;
r=lb(arr,arr+m+1,ii(dist[x+1]%k,1e9))-arr-1;
if (l>r) continue;
trans[r].pub(ii(l,(dist[x+1]/k)));
//cout<<l<<" "<<r<<" "<<(dist[x+1]/k+1)<<endl;
}
memo[0]=(l/k+1)*w;
root->update(0,line({-0,memo[0]-pref[0]}));
rep(x,0,m){
memo[x+1]=memo[x]+((l-arr[x].fi)/k+1)*w;
for (auto &it:trans[x]){
memo[x+1]=min(memo[x+1],
root->query(it.fi,x,w*it.se)+pref[x+1]+(x+1)*w*it.se);
}
root->update(x+1,line({-(x+1),memo[x+1]-pref[x+1]}));
}
cout<<memo[m]<<endl;
}
