#include <queue>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAX 0x7f7f7f7f7f7f7f7f
using namespace std;
typedef long long ll;
const int W = 505;
const int N = 100005;
struct Node{ int x; ll y; };
struct player{ int x, y; }P[N];
struct Edge{ int to, next; ll weight; }edge[W * W * 36];
struct cmp{ bool operator()(Node x, Node y){ return x.y > y.y; } };
ll dis[W * W * 6], ans = MAX;
bool vis[W][W], vis2[W * W * 6];
int h, w, a, b, c, n, sum, cnt = 1;
int dx[4] = { 1, -1, 0, 0 };
int dy[4] = { 0, 0, 1, -1 };
int head[W * W * 6], dt[W][W];
int ctt = 0;
template<typename T> inline void read(T &x)
{
x = 0; char ch = getchar(); bool flag = false;
while(ch < '0' || ch > '9'){if(ch == '-') flag = true; ch = getchar();}
while('0' <= ch && ch <= '9'){x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
if(flag) x = -x;
}
inline void add(int u, int v, ll w)
{
// cout << "u:" << u << ",v:" << v << ",w:" << w << "\n";
// ctt++;
// if (ctt > 20) exit(0);
edge[cnt].to = v, edge[cnt].weight = w;
edge[cnt].next = head[u], head[u] = cnt++;
}
inline ll Min(ll x, ll y){ return x < y ? x : y; }
inline int id(int x, int y){ return x * (w + 1) + y; } //用一個數字表示一個平面座標
inline void Manhattan_Distance()
{
queue<player> q;
for(register int i = 0;i <= h;i++) for(register int j = 0;j <= w;j++) dt[i][j] = INF;
for(register int i = 1; i <= n; i++){ dt[P[i].x][P[i].y] = 0; q.push(P[i]); }
while(!q.empty())
{
int x = q.front().x, y = q.front().y;
q.pop(); vis[x][y] = false;
for(register int i = 0; i < 4; i++)
{
int xx = x + dx[i], yy = y + dy[i];
if(xx >= 0 && xx <= h && yy >= 0 && yy <= w && dt[xx][yy] > dt[x][y] + 1)
{
dt[xx][yy] = dt[x][y] + 1;
if(!vis[xx][yy])
{
player graph;
graph.x = xx, graph.y = yy;
q.push(graph); vis[xx][yy] = true;
}
}
}
}
}
inline void Dijkstra()
{
priority_queue<Node, vector<Node>, cmp> q;
for(register int i = 0;i <= W * W * 6;i++) dis[i] = MAX;
Node graph; graph.x = id(P[1].x, P[1].y) + 4 * sum, graph.y = 0;
q.push(graph); dis[id(P[1].x, P[1].y) + 4 * sum] = 0;
while(!q.empty())
{
int x = q.top().x;
q.pop(); if(!vis2[x])
{
vis2[x] = true;
for(register int i = head[x];i != 0;i = edge[i].next)
{
int v = edge[i].to;
if (dis[v] > dis[x] + edge[i].weight)
{
dis[v] = dis[x] + edge[i].weight; Node graph;
graph.x = v, graph.y = dis[v];
q.push(graph);
}
}
}
}
}
int main()
{
read(h), read(w), read(a), read(b), read(c), read(n);
for(register int i = 1; i <= n; i++) read(P[i].x), read(P[i].y);
Manhattan_Distance();
sum = (w + 1) * (h + 1); //因爲橫縱座標可以爲0，所以要+1
//通過k * sum的表示方法拆點
for(register int i = 0; i <= h; i++)
{
for(register int j = 0; j <= w; j++)
{
int p = id(i, j);
for(register int k = 0; k < 4; k++)
{
//cout << "p:" << p << ",k:" << k << ",sum:" << sum << "\n";
add(p + k * sum, p + 4 * sum, 0); //球從滾動狀態（無人控球）到停止
add(p + 5 * sum, p + k * sum, b); //球從靜止狀態（有人控球）到將球傳出
add(p + 4 * sum, p + 5 * sum, c * (ll)dt[i][j]); //離球最近的球員（曼哈頓距離）跑過來控球
int xx = i + dx[k], yy = j + dy[k];
// cout << "k:" << k << "\n";
// cout << "p:" "(" << i << "," << j << ")" << "\n";
// cout << "q:" << "(" << xx << "," << yy << ")" << "\n";
if(xx >= 0 && yy >= 0 && xx <= h && yy <= w)
{
int q = id(xx, yy);
add(p + k * sum, q + k * sum, a); //球從一個位置按照其方向滾到相鄰的位置（傳球）
add(p + 5 * sum, q + 5 * sum, c); //球從一個位置按照其方向滾到相鄰的位置（帶球）
}
}
}
}
Dijkstra();
for(register int i = 0; i < 6; i++)
{
ans = Min(ans, dis[id(P[n].x, P[n].y) + i * sum]);
}
//printf("%lld\n", dis[id(P[1].x, P[0].y) + 1 * sum]);
printf("%lld\n", ans);
return 0;
}
