#include <bits/stdc++.h>
using namespace std;
//#define OPENIOBUF

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<22;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
};

class FastOutput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
 protected:
	inline void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE)flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	inline void __write(T x)
	{
		static char stk[64],*top;top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f){}
#ifdef OPENIOBUF
	inline void setTarget(FILE *f) { this->flush(),target=f; }
	~FastOutput(){ flush(); }
#else
	inline void setTarget(FILE *f) { target=f; }
#endif
	template<typename ...T>
	inline void writesp(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	inline void writeln(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	inline FastOutput &operator <<(char x)
		{ return __putc(x),*this; }
	inline FastOutput &operator <<(const char *s)
		{ for(;*s;__putc(*(s++)));return *this; }
	inline FastOutput &operator <<(const string &s)
		{ return (*this)<<s.c_str(); }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastOutput &operator <<(const T &x)
		{ return __write(x),*this; }
}qout;

class FastInput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ buf[fread(buf,1,BUFSIZE,target)]='\0',buf_p=0; }
#endif
 protected:
	inline char __getc()
	{
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		return buf[buf_p++];
#else
		return getc(target);
#endif
	}
 public:
#ifdef OPENIOBUF
	FastInput(FILE *f=stdin): FastIOBase(f){ buf_p=BUFSIZE; }
	inline void setTarget(FILE *f) { this->flush(),target=f; }
#else
	FastInput(FILE *f=stdin): FastIOBase(f){}
	inline void setTarget(FILE *f) { target=f; }
#endif
	inline char getchar() { return __getc(); }
	template<typename ...T>
	inline void read(T &...x)
		{ initializer_list<int>{(this->operator>>(x),0)...}; }
	inline FastInput &operator >>(char &x)
		{ while(isspace(x=__getc()));return *this; }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastInput &operator >>(T &x)
	{
		static char ch,sym;x=sym=0;
		while(isspace(ch=__getc()));
		if(ch=='-') sym=1,ch=__getc();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=__getc());
		return sym?x=-x:x,*this;
	}
	inline FastInput &operator >>(char *s)
	{
		while(isspace(*s=__getc()));
		for(;!isspace(*s) && *s && ~*s;*(++s)=__getc());
		return *s='\0',*this;
	}
	inline FastInput &operator >>(string &s)
	{
		char str_buf[(1<<8)+1],*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=__getc()));
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=__getc()) && *p && ~*p;p++);
			*p='\0',s.append(str_buf);
			if(p!=buf_end) break;
		}
		return *this;
	}
}qin;

} // namespace FastIO
using namespace FastIO;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;
constexpr LL INF=4e18;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#else
#define FILEIO(file)
#endif

namespace NetworkFlow
{
	
template<int MAXN,int MAXM,typename FlowT=int,
		 typename=typename enable_if<is_integral<FlowT>::value>::type>
class MFGraph
{
 private:
	struct Edge{ int to,nxt;FlowT w; }e[2*MAXM+5];
	int cnt,head[MAXN+5],headd[MAXN+5],dep[MAXN+5];
	inline void __addEdge(int u,int v,FlowT w)
		{ e[++cnt]=(Edge){v,head[u],w},head[u]=cnt; }
	bool bfs(int S,int T)
	{
		static int hd,tl,q[MAXN+5];
		memset(dep,0,sizeof(dep));
		memcpy(headd,head,sizeof(head));
		q[hd=tl=1]=S,dep[S]=1;
		for(int u=q[hd];(hd++)<=tl;u=q[hd])
			for(int i=head[u],v;v=e[i].to,i;i=e[i].nxt)
				if(e[i].w && !dep[v])
					dep[v]=dep[u]+1,q[++tl]=v;
		return dep[T];
	}
	FlowT dfs(int u,int T,FlowT flow=numeric_limits<FlowT>::max())
	{
		if(u==T || !flow) return flow;
		FlowT res=flow;
		for(int &i=headd[u],v;v=e[i].to,i;i=e[i].nxt)
			if(e[i].w && dep[v]==dep[u]+1)
			{
				FlowT c=dfs(v,T,min(res,e[i].w));
				e[i].w-=c,e[i^1].w+=c;
				if(!(res-=c)) break;
			}
		if(res==flow) dep[u]=0;
		return flow-res;
	}
 public:
	MFGraph(){ clear(); }
	inline void clear()
		{ cnt=1,memset(head,0,sizeof(head)); }
	inline void addEdge(int u,int v,FlowT w)
		{ __addEdge(u,v,w),__addEdge(v,u,0); }
	inline FlowT maxFlow(int S,int T)
	{
		FlowT res=0;
		while(bfs(S,T)) res+=dfs(S,T);
		return res;
	}
};

template<int MAXN,int MAXM,typename FlowT=int,typename CostT=int,
		 typename=typename enable_if<is_integral<FlowT>::value>::type>
class MCMFGraph
{
 private:
	struct Edge{ int to,nxt;FlowT f;CostT w; }e[2*MAXM+5];
	int cnt,head[MAXN+5],headd[MAXN+5];
	bool vis[MAXN+5];
	CostT dis[MAXN+5],h[MAXN+5];
	inline void __addEdge(int u,int v,FlowT f,CostT w)
		{ e[++cnt]=(Edge){v,head[u],f,w},head[u]=cnt; }
	bool spfa(int S,int T)
	{
		constexpr CostT INF=numeric_limits<CostT>::max();
		static int hd,tl,q[MAXN+5];
		for(int i=1;i<=MAXN;i++) dis[i]=INF,vis[i]=false;
		q[hd=tl=1]=S,dis[1]=0;
		while(hd<=tl)
		{
			int u=q[hd++];
			for(int i=head[u],v;(v=e[i].to);i=e[i].nxt)
			{
				if(!e[i].f) continue;
				if(dis[v]<=dis[u]+e[i].w) continue;
				dis[v]=dis[u]+e[i].w;
				if(!vis[v]) q[++tl]=v,vis[v]=true;
			}
		}
		return dis[T]!=INF;
	}
	bool dijkstra(int S,int T)
	{
		constexpr CostT INF=numeric_limits<CostT>::max();
		for(int i=1;i<=MAXN;i++) dis[i]=INF,vis[i]=false;
		priority_queue<pair<CostT,int>,vector<pair<CostT,int>>,greater<>> q;
		q.emplace(dis[S]=0,S);
		while(!q.empty())
		{
			int u=q.top().second;
			q.pop();
			if(vis[u]) continue;
			vis[u]=true;
			for(int i=head[u],v;(v=e[i].to);i=e[i].nxt)
			{
				if(!e[i].f) continue;
				CostT w=e[i].w+h[u]-h[v];
				if(dis[u]+w>=dis[v]) continue;
				q.emplace(dis[v]=dis[u]+w,v);
			}
		}
		return dis[T]!=INF;
	}
	FlowT dfs(int u,int T,CostT &cst,FlowT flow=numeric_limits<FlowT>::max())
	{
		if(u==T || !flow) return flow;
		FlowT res=flow;
		vis[u]=true;
		for(int &i=headd[u],v;(v=e[i].to);i=e[i].nxt)
			if(!vis[v] && e[i].f && dis[v]+h[v]==dis[u]+h[u]+e[i].w)
			{
				FlowT c=dfs(v,T,cst,min(res,e[i].f));
				e[i].f-=c,e[i^1].f+=c,cst+=c*e[i].w;
				if(!(res-=c)) break;
			}
		vis[u]=false;
		if(res==flow) vis[u]=true;
		return flow-res;
	}
 public:
	MCMFGraph(){ clear(); }
	inline void clear()
		{ cnt=1,memset(head,0,sizeof(head)); }
	inline void addEdge(int u,int v,FlowT f,CostT w)
		{ __addEdge(u,v,f,w),__addEdge(v,u,0,-w); }
	inline pair<FlowT,CostT> MCMF(int S,int T,bool neg_cost=false)
	{
		FlowT mxf=0,dt=0;
		CostT mnc=0;
		memset(h,0,sizeof(h));
		if(neg_cost?spfa(S,T):dijkstra(S,T)) do
		{
			memcpy(headd,head,sizeof(head));
			memset(vis,0,sizeof(vis));
			dt=0,mxf+=dfs(S,T,dt),mnc+=dt;
			for(int i=1;i<=MAXN;i++) h[i]+=dis[i];
		}while(dijkstra(S,T));
		return make_pair(mxf,mnc);
	}
};

} // namespace NetworkFlow
using namespace NetworkFlow;

int n,m,A,B,C,nn,S,T,hb[45][45],vb[45][45],hw[45][45],vw[45][45];
char a[45][45];
LL w0[10005],w1[10005];
map<pair<int,int>,LL> mp;
MFGraph<10000,1000000,LL> g;
int main()
{
	qin>>n>>m>>A>>B>>C;
	for(int i=1;i<=n;i++) qin>>(a[i]+1);
	S=++nn,T=++nn;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
	{
		hb[i][j]=++nn,vb[i][j]=++nn;
		hw[i][j]=++nn,vw[i][j]=++nn;
	}
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
	{
		w1[vb[i][j]]+=A,w0[hb[i][j]]+=A;
		w0[vw[i][j]]+=A,w1[hw[i][j]]+=A;
		if(i==n) w1[vb[i][j]]+=B,w0[vw[i][j]]+=B;
		if(j==m) w0[hb[i][j]]+=B,w1[hw[i][j]]+=B;
		if(i<n) mp[{vb[i][j],vb[i+1][j]}]+=B,mp[{vw[i+1][j],vw[i][j]}]+=B;
		if(j<m) mp[{hb[i][j+1],hb[i][j]}]+=B,mp[{hw[i][j],hw[i][j+1]}]+=B;
	}
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
		if(a[i][j]=='#')
		{
			mp[{hb[i][j],vb[i][j]}]+=C;
			w0[vw[i][j]]=w1[hw[i][j]]=INF;
		}
		else
		{
			mp[{vb[i][j],hw[i][j]}]+=C;
			mp[{vw[i][j],hb[i][j]}]+=C;
			mp[{vb[i][j],hb[i][j]}]=INF;
		}
	for(int i=3;i<=nn;i++) g.addEdge(i,T,w0[i]),g.addEdge(S,i,w1[i]);
	for(auto &[i,w]: mp) g.addEdge(i.second,i.first,w);
	qout<<g.maxFlow(S,T);
	return 0;
}