#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
LLI T;
LLI S[200001],pre[200000];
bool comp(LLI a,LLI b) {
if ((a % T) == (b % T)) return a < b;
else return (a % T) < (b % T);
}
pair<LLI,int> p[200000];
LLI dp[200000];
struct line { LLI m,b; };
bool bad(line a,line b,line c) {
return (b.b-a.b)*(b.m-c.m) >= (c.b-b.b)*(a.m-b.m);
}
vector<line> hull;
int main() {
int i;
LLI X;
int N,M,W;
scanf("%lld %d %d %d %lld",&X,&N,&M,&W,&T);
for (i = 0; i < N; i++) scanf("%lld",&S[i]);
S[N++] = X,sort(S,S+N,comp);
for (i = 0; i < M; i++) scanf("%lld %d",&p[i].first,&p[i].second);
sort(p,p+M);
int j = 0,k;
for (i = 0; i < M; i++) pre[i] = p[i].second+((i == 0) ? 0:pre[i-1]);
hull.pb((line){1,0});
for (i = 0; i < M; i++) {
while ((j < N) && ((S[j] % T) < p[i].first)) j++;
dp[i] = W*((X-p[i].first)/T+1)+((i == 0) ? 0:dp[i-1]);
if ((j < N) && ((i == M-1) || ((S[j] % T) < p[i+1].first))) {
LLI s = S[j];
while ((j < N) && ((S[j] % T) < ((i == M-1) ? T:p[i+1].first))) s = min(s,S[j]),j++;
int l = 0,r = (int) hull.size()-1;
LLI x = W*(s/T);
while (l < r) {
int m = (l+r) / 2;
if (hull[m].m*x+hull[m].b < hull[m+1].m*x+hull[m+1].b) r = m;
else l = m+1;
}
dp[i] = min(dp[i],hull[l].m*x+hull[l].b+pre[i]+i*x);
/*LLI c = 0;
for (k = i; k >= 0; k--) {
c += p[k].second;
dp[i] = min(dp[i],c+((k == 0) ? 0:dp[k-1])+(LLI) W*(i-k+1)*(s/T));
}*/
}
line l = {-i,dp[i]-pre[i]};
while ((hull.size() >= 2) && bad(hull[hull.size()-2],hull.back(),l)) hull.pop_back();
hull.pb(l);
}
printf("%lld\n",dp[M-1]+(LLI) W*(X/T+1));
return 0;
}
