#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e14;
const int mod2 = 1e9 + 7;
const int mod1 = 998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, l, r, mid, l2, r2, center;
int i, s10, s12,k1,k2,s11,t,lim,w;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
///modwwe
phongbeo();
// checktime
}
int a[2002];
ib b[2001];
int d[2001];
int c[2001];
int dp[2001];
int f[2001];
bool cmp(ib x,ib y)
{
return x.a<y.a;
}
void phongbeo()
{
cin>>lim>>n>>m>>k>>t;
for(int i=1; i<=n; i++)
cin>>a[i];
sort(a+1,a+1+n);
for(int i=1; i<=m; i++)
cin>>b[i].a>>b[i].b;
sort(b+1,b+1+m,cmp);
for(int i=1; i<=m; i++)
d[i]=b[i].a,c[i]=b[i].b;
a[n+1]=lim;
for(int i=1; i<=n+1; i++)
{
s2=a[i]%t;
s3=upper_bound(d+1,d+1+m,s2)-d-1;
if(f[s3]==0)
f[s3]=i;
}
for(int i=1; i<=m; i++)
c[i]+=c[i-1];
/// dpi la da duyet het con tren i
dp[0]=(lim/t)*k+k;
for(int i=1; i<=m; i++)
{
if(lim>=d[i])
dp[i]=dp[i-1]+((lim-d[i])/t)*k+k;
if(f[i]!=0)
{
for(int j=0; j<i; j++){
dp[i]=min(dp[i],dp[j]+(i-j)*(a[f[i]]/t)*k+c[i]-c[j]);
}
}
}
cout<<dp[m];
}
