#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
#define sgn(x) ((x)&1?-1:1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
    int x=0,w=1; char c=getchar(); 
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
    return x*w;
}

const int N=1e6+9;
int X,n,m,w,a[N],T,s[N],t[N],g[N],st[N],top,f[N],c[N],y[N];
pii p[N];

bool cmpc(int a,int b,int c) {
    return (y[a]-y[b])*(b-c)<(y[b]-y[c])*(a-b);
}
bool cmpk(int a,int b,int k) {
    return y[a]-y[b]<k*(b-a);
}

signed main() {
    X=read(), n=read(), m=read(), w=read(), T=read();
    rep(i,1,n) s[i]=read(); s[++n]=X;
    rep(i,1,m) p[i].fi=read(), p[i].se=read();
    sort(p+1,p+m+1);
    rep(i,1,m) c[i]=c[i-1]+p[i].se;
    rep(i,1,m) a[i]=s[n]/T+(p[i].fi<=s[n]%T);
    rep(i,1,m) t[i]=p[i].fi, g[i]=a[i];
    rep(i,1,n) {
        int p=lower_bound(t,t+m+1,s[i]%T)-t-1;
        if(p) g[p]=min(g[p],s[i]/T);
    }
    f[0]=w*(s[n]/T+1), y[0]=f[0], st[++top]=0;
    rep(i,1,m) {
        f[i]=f[i-1]+a[i]*w;
        int l=2,r=top,res=y[0];
        while(l<=r) {
            int mid=l+r>>1; res=min(res,y[st[mid]]-w*g[i]*st[mid]);
            if(cmpk(st[mid-1],st[mid],w*g[i])) l=mid+1;
            else r=mid-1;
        }
        f[i]=min(f[i],res+w*g[i]*i+c[i]);
        y[i]=f[i]-c[i];
        while(top>1&&!cmpc(st[top-1],st[top],i)) top--;
        st[++top]=i;
    }
    printf("%lld\n",f[m]);
    return 0;
}