#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
const int N=1e4+5,M=1e6+5;
const int inf=1e9;
struct edge{
	int v,w,nx;
}e[M];
int T,n,m,ne,f[N],deep[N],cur[N];
char str[45][45];
queue<int> q;
int id(int x,int y){return (x-1)*m+y;}
void read(int u,int v,int w)
{	e[++ne]=(edge){v,w,f[u]};
	f[u]=ne;
}
void addedge(int u,int v,int w){
	read(u,v,w),read(v,u,0);//printf("%d %d %d\n",u,v,w);
}
bool bfs(int s,int t)
{	memset(deep,0x7f,sizeof(deep));
	for(int i=0;i<=t;i++)cur[i]=f[i];
	while(!q.empty())q.pop();
	deep[s]=0,q.push(s);
	while(!q.empty())
	{	int now=q.front();
		q.pop();
 		for(int i=f[now];i!=-1;i=e[i].nx)
 			if(e[i].w&&deep[e[i].v]>=inf)deep[e[i].v]=deep[now]+1,q.push(e[i].v);
    }
	return deep[t]<inf;
}
int dfs(int now,int t,int limit)
{   if(!limit||now==t)return limit;
    int flow=0,x;
    for(int i=cur[now];i!=-1;i=e[i].nx)
    {	cur[now]=i;
		if(deep[e[i].v]==deep[now]+1)
        {	x=dfs(e[i].v,t,min(limit,e[i].w));
			if(x==0)continue;
			flow+=x,limit-=x,e[i].w-=x,e[i^1].w+=x;
			if(limit==0)break;
		}
	}
	return flow;
}
int dinic(int s,int t)
{	int maxflow=0;
	while(bfs(s,t))maxflow+=dfs(s,t,inf);
	return maxflow;
}
int main()
{	int a,b,c,s,t;
	scanf("%d%d%d%d%d",&n,&m,&a,&b,&c);
	s=((id(n,m)+1)<<2)+1,t=((id(n,m)+1)<<2)+2;
	ne=-1,memset(f,-1,sizeof(f));
	for(int i=1;i<=n;i++)
		for(int j=0;j<m;j++)
		{	int bx=(id(i,j)<<2),wx=bx+1,by=bx+2,wy=bx+3;
			addedge(s,bx,a+((j==0)?(b):(0))),addedge(bx,t,0);
			addedge(s,wx,0),addedge(wx,t,a+((j==0)?(b):(0)));
			addedge(s,by,0),addedge(by,t,a+((i==1)?(b):(0)));
			addedge(s,wy,a+((i==1)?(b):(0))),addedge(wy,t,0);
			int bxx=(id(i,j-1)<<2),wxx=bxx+1,byy=bxx+2,wyy=bxx+3;
			if(j>0)addedge(bxx,bx,b),addedge(wx,wxx,b);
			bxx=(id(i-1,j)<<2),wxx=bxx+1,byy=bxx+2,wyy=bxx+3;
			if(i>1)addedge(by,byy,b),addedge(wyy,wy,b);
		}
	for(int i=1;i<=n;i++)
	{	scanf("%s",str[i]);
		for(int j=0;j<m;j++)
		{	int bx=(id(i,j)<<2),wx=bx+1,by=bx+2,wy=bx+3;
			if(str[i][j]=='#')addedge(wx,t,inf),addedge(s,wy,inf),addedge(bx,by,c);
			else addedge(by,bx,inf),addedge(by,wy,inf),addedge(wx,bx,inf),addedge(wy,bx,c),addedge(by,wx,c);
		}
	}
	printf("%d\n",dinic(s,t));
	return 0;
}