#include <cstdio>
#include <algorithm>

int H, W;
long long A, B, C;
int N;
int S[100010], T[100010];

int dis(int a, int b) {
    return abs(S[a] - S[b]) + abs(T[a] - T[b]);
}

int main() {
    freopen("play.in", "r", stdin);
    freopen("play.out", "w", stdout);
    scanf("%d %d", &H, &W);
    scanf("%lld %lld %lld", &A, &B, &C);
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i) {
        scanf("%d %d", &S[i], &T[i]);
    }
    
    if (S[1] == S[2] || T[1] == T[2]) {
        printf("%lld\n", std::min(C * dis(1, 2), A * dis(1, 2) + B));
    } else {
        printf("%lld\n", std::min({C * abs(S[1] - S[2]) + A * abs(T[1] - T[2]) + B,
                                   C * abs(T[1] - T[2]) + A * abs(S[1] - S[2]) + B,
                                   C * dis(1, 2)}));
    }
    return 0;
}