#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 40, maxs = 6400;
struct edge { int v, f; };
vector<edge> e;
vector<int> g[maxs + 5];
inline void addE(int u, int v, int w) {
	g[u].PB(e.size()), e.PB({v, w});
	g[v].PB(e.size()), e.PB({u, 0});
}
int d[maxs + 5];
int cur[maxs + 5];
int S, T;
bool bfs(int s, int t) {
	memset(d, 127, sizeof(d)), memset(cur, 0, sizeof(cur));
	queue<int> q;
	q.push(s), d[s] = 0; 
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (int eid : g[u]) {
			int v = e[eid].v, f = e[eid].f;
			if (f && d[v] > T) {
				q.push(v), d[v] = d[u] + 1;
				if (v == t) return 1;
			}
		}
	}
	return 0;
}
int dfs(int u, int t, int fl) {
	if (u == t) return fl;
	int rs = 0;
	for (int i = cur[u]; i < g[u].size(); i++) {
		cur[u] = i;
		int eid = g[u][i], v = e[eid].v, f = e[eid].f;
		if (f && d[v] == d[u] + 1) {
			int nf = dfs(v, t, min(fl, f));
			e[eid].f -= nf, e[eid ^ 1].f += nf;
			fl -= nf, rs += nf;
			if (!fl) break;
		}
	}
	return rs;
}
int dinic(int s, int t) {
	int rs = 0;
	while (bfs(s, t)) rs += dfs(s, t, INT_MAX);
	return rs;
}
char mp[maxn + 5][maxn + 5];
int wr[maxn + 5][maxn + 5], wc[maxn + 5][maxn + 5], br[maxn + 5][maxn + 5], bc[maxn + 5][maxn + 5];
int main() {
	int n, m, A, B, C;
	scanf("%d%d%d%d%d", &n, &m, &A, &B, &C);
	for (int i = 1; i <= n; i++) scanf("%s", mp[i] + 1);
	S = n * m * 4 + 1, T = S + 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			int id = (i - 1) * m + j;
			wr[i][j] = id * 4 - 3, wc[i][j] = id * 4 - 2, br[i][j] = id * 4 - 1, bc[i][j] = id * 4;
			addE(S, br[i][j], 5E5), addE(br[i][j], T, A + 5E5);
			addE(S, bc[i][j], A + 5E5), addE(bc[i][j], T, 5E5);
			addE(S, wc[i][j], 5E5), addE(wr[i][j], T, 5E5);
			if (mp[i][j] == '.') {
				addE(S, wr[i][j], A + 5E5), addE(wc[i][j], T, A + 5E5);
				addE(br[i][j], bc[i][j], 5E5);
				addE(br[i][j], wc[i][j], C), addE(wr[i][j], bc[i][j], C);
			} else {
				addE(S, wr[i][j], 1E6), addE(wc[i][j], T, 1E6);
				addE(bc[i][j], br[i][j], C);
			}
		}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			if (j < m) addE(br[i][j], br[i][j + 1], B), addE(wr[i][j + 1], wr[i][j], B);
			else addE(br[i][j], T, B), addE(S, wr[i][j], B);
			if (i < n) addE(bc[i + 1][j], bc[i][j], B), addE(wc[i][j], wc[i + 1][j], B);
			else addE(S, bc[i][j], B), addE(wc[i][j], T, B);
		}
	printf("%d\n", dinic(S, T) - n * m * (int)2E6);
}