//by shenben

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<queue>

#define setfire(name) freopen(#name".in","r",stdin);freopen(#name".out","w",stdout);

using namespace std;

const int N=;

const int Z=;

const int inf=0x3f3f3f3f;

char mp[N][N];bool vis[N][N];int id[N][N];

int n,m,k,S,T,a,b,ans,f[Z][];

int dx[],dy[];

struct M{

    int x,y,step;

    M(int x=,int y=,int step=):x(x),y(y),step(step){}

};

struct edge{int v,next,cap,cost;}e[Z*Z*];int tot=,head[Z<<];bool mark[Z<<];

int dist[Z][Z],prev[Z<<],dis[Z<<],q[Z*];

inline int read(){

    register int x=;register char ch=getchar();

    while(ch<''||ch>''){ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x;

}

inline void add(int x,int y,int z,int cost){

    e[++tot].v=y;e[tot].cap=z;e[tot].cost=cost;e[tot].next=head[x];head[x]=tot;

    e[++tot].v=x;e[tot].cap=;e[tot].cost=-cost;e[tot].next=head[y];head[y]=tot;

}

inline void init(){

    n=read();m=read();k=read();a=read();b=read();

    if(n==&&m==&&k==&&a==&&b==){puts("");exit();}

    dx[]=a;dx[]=a;dx[]=-a;dx[]=-a;dx[]=b;dx[]=b;dx[]=-b;dx[]=-b;

    dy[]=b;dy[]=-b;dy[]=b;dy[]=-b;dy[]=-a;dy[]=a;dy[]=a;dy[]=-a;

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

    for(int i=;i<=k;i++) f[i][]=read(),f[i][]=read();

    for(int i=,x,y;i<=k;i++) x=read(),y=read(),id[x][y]=i;

}

inline bool inside(int x,int y){

    return (x>&&x<=n&&y>&&y<=m);

}

inline void bfs(int num){

    int cnt=,sx=f[num][],sy=f[num][];

    memset(vis,,sizeof vis);

    queue<M>q;q.push(M(sx,sy,));

    if(id[sx][sy]){

        dist[num][id[sx][sy]]=;

        if(++cnt==k) return ;

    }

    while(q.size()){

        M now=q.front();q.pop();

        for(int i=,nx,ny;i<=;i++){

            nx=now.x+dx[i];ny=now.y+dy[i];

            if(vis[nx][ny]||!inside(nx,ny)||mp[nx][ny]=='*') continue;

            vis[nx][ny]=;

            if(id[nx][ny]){

                if(dist[num][id[nx][ny]]==inf) dist[num][id[nx][ny]]=now.step+;

                if(++cnt==k) return ;

            }

            q.push(M(nx,ny,now.step+));

        }

    }

}

inline void mapping(){

    memset(dist,inf,sizeof dist);

    S=;T=k<<|;

    for(int i=;i<=k;i++){

        bfs(i);

    }

    for(int i=;i<=k;i++){

        for(int j=;j<=k;j++){

            if(dist[i][j]!=inf) add(i,j+k,,dist[i][j]);

        }

    }

    for(int i=;i<=k;i++) add(S,i,,),add(i+k,T,,);

}

/*稠密图EK不如zkw跑的快

inline bool spfa(){

    for(int i=S;i<=T;i++) mark[i]=0,dis[i]=inf;

    unsigned short h=0,t=1;q[t]=S;dis[S]=0;

    while(h!=t){

        int x=q[++h];mark[x]=0;

        for(int i=head[x];i;i=e[i].next){

            if(e[i].cap&&dis[e[i].v]>dis[x]+e[i].cost){

                dis[e[i].v]=dis[x]+e[i].cost;

                prev[e[i].v]=i;

                if(!mark[e[i].v]){

                    mark[e[i].v]=1;

                    if(dis[e[i].v]<dis[x]) q[h--]=e[i].v;

                    else q[++t]=e[i].v;

                }

            }

        }

    }

    return dis[T]!=inf;

}

inline void augment(){

    int flow=inf;

    for(int i=T;i!=S;i=e[prev[i]^1].v){

        flow=min(flow,e[prev[i]].cap);

    }

    for(int i=T;i!=S;i=e[prev[i]^1].v){

        e[prev[i]].cap-=flow;

        e[prev[i]^1].cap+=flow;

    }

    ans+=flow*dis[T];

}*/

inline bool spfa(){

    for(int i=S;i<=T;i++) mark[i]=,dis[i]=inf;

    int h=,t=;q[t]=T;dis[T]=;mark[T]=;

    while(h!=t){

        int x=q[++h];mark[x]=;

        for(int i=head[x];i;i=e[i].next){

            int v=e[i].v;

            if(e[i^].cap&&dis[v]>dis[x]+e[i^].cost){

                dis[v]=dis[x]+e[i^].cost;

                if(!mark[v]){

                    mark[v]=;

                    q[++t]=v;

                }

            }

        }

    }

    return dis[S]<inf;

}

int dfs(int x,int f){

    mark[x]=;

    if(x==T) return f;

    int used=,w;

    for(int i=head[x];i;i=e[i].next){

        int v=e[i].v;

        if(!mark[v]&&e[i].cap&&dis[v]+e[i].cost==dis[x]){

            w=dfs(v,min(f-used,e[i].cap));

            e[i].cap-=w;e[i^].cap+=w;

            ans+=w*e[i].cost;

            used+=w;

            if(used==f) return used;

        }

    }

    return used;

}

inline void zkw(){

    while(spfa()){

        mark[T]=;

        while(mark[T]){

            memset(mark,,sizeof mark);

            dfs(S,inf);

        }

    }

}

int main(){

    setfire(chess);

    init();

    mapping();

    zkw();

    //while(spfa()) augment();

    printf("%d",ans);

    return ;

}

//最后一个点5.39s,zkw费用流死活跑不过去