#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 LL;
typedef pair<int, int> pii;
const int MAXN = 2e5 + 5;
const ll linf = 0x3f3f3f3f3f3f3f3f;

struct Vector {
    LL x, y;
    LL get(LL k) const {
        return y - k * x;
    }
};
Vector operator - (const Vector &p, const Vector &q) {
    return Vector{p.x - q.x, p.y - q.y};
}
LL cross(const Vector &p, const Vector &q) {
    return p.x * q.y - p.y * q.x;
}

ll s[MAXN];
array<ll, 2> p[MAXN];
ll val[MAXN], sum[MAXN], dp[MAXN];

int main(void) {
    int n, m;
    ll X, W, T;
    scanf("%lld%d%d%lld%lld", &X, &n, &m, &W, &T);

    for (int i = 1; i <= n; ++i)
        scanf("%lld", &s[i]);

    for (int i = 1; i <= m; ++i)
        scanf("%lld%lld", &p[i][0], &p[i][1]);

    p[0] = {0, 0};
    s[++n] = X;

    sort(p + 1, p + m + 1);

    memset(val, 0x3f, sizeof(val));

    for (int i = 1; i <= n; ++i) {
        int pos = lower_bound(p + 1, p + m + 1, array<ll, 2> {s[i] % T, 0}) - p - 1;

        if (pos >= 1)
            val[pos] = min(val[pos], s[i] / T * W);
    }

    for (int i = 1; i <= m; ++i)
        sum[i] = sum[i - 1] + p[i][1] - ((X - p[i][0]) / T + 1) * W;

    static Vector h[MAXN];
    int hd = 1, tl = 0;
    auto push = [&](Vector cur) {
        while (hd + 1 <= tl && cross(cur - h[tl], cur - h[tl - 1]) >= 0)
            --tl;

        h[++tl] = cur;
    };
    auto query = [&](LL k) {
        int l = hd, r = tl;

        while (l < r) {
            int mid = (l + r) >> 1;

            if (h[mid + 1].get(k) <= h[mid].get(k))
                l = mid + 1;
            else
                r = mid;
        }

        return h[l].get(k);
    };

    dp[0] = 0;
    push(Vector{0, (LL)dp[0] - sum[0]});

    for (int i = 1; i <= m; ++i) {
        dp[i] = dp[i - 1];

        if (val[i] < linf) {
            dp[i] = min((LL)dp[i], query(val[i]) + sum[i] + (LL)i * val[i]);
        }

        push(Vector{i, (LL)dp[i] - sum[i]});
    }

    ll ans = dp[m];

    for (int i = 0; i <= m; ++i)
        ans += ((X - p[i][0]) / T + 1) * W;

    printf("%lld\n", ans);
    return 0;
}