#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define int long long
#define eb emplace_back
#define ll long long
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=2025;
int x,n,m,w,t; ll s[N],dp[N];
ii pas[N];
int can[N];
ll calc(ll d){
return 1LL * ((x-d)/t + 1) * w;
}
void solve(){
cin>>x>>n>>m>>w>>t;
foru(i,1,n) cin>>s[i];
foru(i,1,m) cin>>pas[i].fi>>pas[i].se;
sort(pas+1, pas+1+m);
s[++n]=x;
memset(can,-1,sizeof(can));
foru(i,1,n){
int l=lower_bound(pas+1, pas+1+m, ii(s[i]%t,0)) - pas - 1;
if(can[l]==-1) can[l]=s[i]/t;
else mini(can[l], s[i]/t);
}
memset(dp,0x3f,sizeof(dp));
dp[0]=calc(0);
foru(i,1,m){
if(can[i]!=-1){
ll cost=0;
ford(j,i,1){
cost+=pas[j].se + calc(pas[j].fi)-calc(pas[j].fi+can[i]*t);
mini(dp[i],dp[j-1]+cost);
}
}
mini(dp[i], dp[i-1]+calc(pas[i].fi));
}
cout<<dp[m]<<'\n';
}
int32_t main(){
#define task "test"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
rep(_,tc){
solve();
}
}
