#include <bits/stdc++.h>
#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 pii pair<int,int>
#define fi first
#define se second
#define int long long
#define inf 1e18
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int MAXN=2e5+5;
struct node{
    int D,C;
    bool operator <(const node a)const{return D<a.D;}
}a[MAXN];
int X,N,M,W,T,S[MAXN],f[MAXN],stk[MAXN],top=1;
bool cmp(int a,int b){return a%T<b%T;}
//斜率优化
pii Node(int x){return {-x*W,f[x]-a[x].C};}
long double slope(pii A,pii B){
    return 1.0*(A.se-B.se)/(A.fi-B.fi);
}
bool chk(int a,int b,int c){
    pii A=Node(a),B=Node(b),C=Node(c);
    return slope(A,B)<slope(A,C);
}
int calc(pii A,int x){return A.fi*x+A.se;}
int get(int X){//单调栈上二分
    int L=1,R=top;
    while(L<R){
        int mid=(L+R)>>1;
        if(calc(Node(stk[mid]),X)>calc(Node(stk[mid+1]),X)){
            L=mid+1;
        }else R=mid;
    }
    return calc(Node(stk[L]),X);
}
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){
        a[i].D=read(),a[i].C=read();
    }
    sort(S+1,S+N+1,cmp);sort(a+1,a+M+1);
    a[M+1].D=T;
    rep(i,1,M)a[i].C+=a[i-1].C;
    memset(f,0x3f,sizeof(f));f[0]=0;
    int pos=1;
    while(pos<=N&&S[pos]%T<=a[1].D)pos++;
    rep(i,1,M){
        int Min=inf;
        while(pos<=N&&S[pos]%T<a[i+1].D){
            Min=min(Min,S[pos++]/T);
        }
        //留人
        f[i]=f[i-1]+((X-a[i].D)/T+1)*W;
        //cnm,退钱!
        if(Min!=inf){
            f[i]=min(f[i],get(Min)+Min*W*i+a[i].C);
        }
        while(top>1&&chk(stk[top-1],stk[top],i))--top;
        stk[++top]=i;
    }
    printf("%lld\n",f[M]+(X/T+1)*W);
    return 0;
}