#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
int n,m;
vpii adj(int x, int y){
vpii ret;
if(x != 0)ret.pb(mp(x-1, y));
if(x != n-1)ret.pb(mp(x+1, y));
if(y != 0)ret.pb(mp(x, y-1));
if(y != m-1)ret.pb(mp(x, y+1));
return ret;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
cin>>n>>m;
n++; m++;
in3(a,b,c);
in(k);
vpii pts;
f0r(i,k){
in2(x,y);
pts.pb(mp(x,y));
}
vvi nearestplayer(n, vi(m, 4e18));
queue<pii>q;
f0r(i,k){
int x = pts[i].first;
int y = pts[i].second;
q.push(mp(x,y));
nearestplayer[x][y] = 0;
}
while(!q.empty()){
pii node = q.front();
q.pop();
for(auto u : adj(node.first,node.second)){
if(nearestplayer[u.first][u.second] == 4e18){
nearestplayer[u.first][u.second] = nearestplayer[node.first][node.second] + 1;
q.push(u);
}
}
}
vector<vpii> ad(n*m*3 + 10);
f0r(i, n){
f0r(j,m){
for(auto u : adj(i,j)){
ad[i * m + j].pb(mp(u.first * m + u.second, c));
if(u.first != i)ad[i * m + j + n * m].pb(mp(u.first * m + u.second + n * m, a));
else ad[i * m + j + 2 * n * m].pb(mp(u.first * m + u.second + 2 * n * m, a));
}
ad[i * m + j].pb(mp(i * m + j + n * m, b));
ad[i * m + j + n * m].pb(mp(i * m + j, nearestplayer[i][j] * c));
ad[i * m + j].pb(mp(i * m + j + n * m * 2, b));
ad[i * m + j + n * m * 2].pb(mp(i * m + j, nearestplayer[i][j] * c));
}
}
vi dist(n * m * 3 + 10, 4e18);
int st = pts[0].first * m + pts[0].second;
priority_queue<pii>pq;
dist[st] = 0;
pq.push(mp(0,st));
vb vis(n*m*3 + 10);
while(!pq.empty()){
int node = pq.top().second;
pq.pop();
if(vis[node])continue;
vis[node] = 1;
for(auto u : ad[node]){
if(dist[u.first] > dist[node] + u.second){
dist[u.first] = dist[node] + u.second;
pq.push(mp(-dist[u.first], u.first));
}
}
}
// dout(dist[st + n * m + 3]);
int en = pts[k-1].first * m + pts[k-1].second;
out(dist[en]);
}
