#include<bits/stdc++.h>
#define N 100005
#define M 505
#define ll long long
#define pii pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
const ll inf=1e18;
int n,m,ct,X[N],Y[N],A,B,C;
ll dis[N<<5];
int tot,id[3][M][M],mk[N<<5],fl[M][M],mn[M][M];
vector<pii>road[N<<5];
void add(int u,int v,ll c){road[u].pb(mp(v,c));}
void Add(int u,int v,ll c){add(u,v,c),add(v,u,c);}
priority_queue<pii>pq; 
void dj(int S){
	for(int i=1;i<=tot;++i)dis[i]=inf;
	dis[S]=0,pq.push(mp(-dis[S],S));
	while(pq.size()){
		int x=pq.top().se;pq.pop();
		if(mk[x])continue;mk[x]=1;
		for(auto v:road[x])
			if(dis[v.fi]>dis[x]+v.se)
				dis[v.fi]=dis[x]+v.se,pq.push(mp(-dis[v.fi],v.fi));
	}
}
queue<pii>q;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
void Init(){
	for(int i=0;i<=n;++i)
		for(int j=0;j<=m;++j){
			mn[i][j]=(fl[i][j]?0:1e9);
			if(!mn[i][j])q.push(mp(i,j));
		}
	while(q.size()){
		pii a=q.front();q.pop();
		int x=a.fi,y=a.se;
		for(int i=0,px,py;i<4;++i){
			px=x+dx[i],py=y+dy[i];
			if(mn[px][py]>mn[x][y]+1)mn[px][py]=mn[x][y]+1,q.push(mp(px,py));
		}
	}
}
int main(){
	scanf("%d%d%d%d%d%d",&n,&m,&A,&B,&C,&ct);
	for(int i=1;i<=ct;++i)scanf("%d%d",&X[i],&Y[i]),fl[X[i]][Y[i]]=1;
	Init();
	for(int i=0;i<=n;++i)
		for(int j=0;j<=m;++j){
			id[0][i][j]=++tot;
			id[1][i][j]=++tot,id[2][i][j]=++tot;
			add(id[0][i][j],id[1][i][j],B);
			add(id[0][i][j],id[2][i][j],B);
			add(id[1][i][j],id[0][i][j],1ll*C*mn[i][j]);
			add(id[2][i][j],id[0][i][j],1ll*C*mn[i][j]);
		}
	for(int i=0;i<=n;++i)
		for(int j=0;j<=m;++j){
			if(i<n)Add(id[1][i][j],id[1][i+1][j],A),Add(id[0][i][j],id[0][i+1][j],C);
			if(j<m)Add(id[2][i][j],id[2][i][j+1],A),Add(id[0][i][j],id[0][i][j+1],C);
		}
	dj(id[0][X[1]][Y[1]]);
	cout<<dis[id[0][X[ct]][Y[ct]]];
	return 0;
}