#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>

typedef int ll;
const ll N = 500;
const ll M = 500;
const ll inf = 0x3f3f3f3f;
ll n, m, a, b, c, s, t, cnt, ans;
char ch;
ll bh[N][M], bs[N][M], wh[N][M], ws[N][M];
struct edge {
    ll to, nxt, w;
} eg[N * M * 100];
ll head[N * 100], egtot = 1;
ll now[N * 100];

void add (ll u, ll v, ll w) {
    eg[++egtot].to = v;
    eg[egtot].nxt = head[u];
    eg[egtot].w = w;
    head[u] = egtot;

    eg[++egtot].to = u;
    eg[egtot].nxt = head[v];
    eg[egtot].w = 0;
    head[v] = egtot;
}

ll d[N * 100];

bool BFS () {
     memset(d, 0, sizeof(d));
	std::queue < ll > q;
	q.push(s);
	d[s] = 1;
    now[s] = head[s];
	while (!q.empty()) {
		ll x = q.front();
		q.pop();
		for (ll i = head[x]; i; i = eg[i].nxt) {
			if (!eg[i].w) continue;
			ll to = eg[i].to;
			if (d[to]) continue;
			d[to] = d[x] + 1;
			now[to] = head[to];
			q.push(to);
			 if (to == t) return true;
		}
	}
	return false;
}

ll dinic (ll x, ll flow) {
	if (x == t) return flow;
	ll res = flow;
	for (ll i = now[x]; i; i = eg[i].nxt) {
		now[x] = i;
		if (!eg[i].w) continue;
		ll to = eg[i].to;
		if (d[to] != d[x] + 1) continue;
		ll k = dinic (to, std::min(res, eg[i].w));
		res -= k;
		eg[i].w -= k;
		eg[i ^ 1].w += k; 
	}
	return flow - res;
}

int main() {
    std::cin >> n >> m >> a >> b >> c;
    for (ll i = 1; i <= n; i++)
        for (ll j = 1; j <= m; j++)
            bh[i][j] = ++cnt, bs[i][j] = ++cnt, wh[i][j] = ++cnt, ws[i][j] = ++cnt;
    s = ++cnt, t = ++cnt;
    for (ll i = 1; i <= n; i++)
        for (ll j = 1; j <= m; j++) {
            std::cin >> ch;
            add(s, bh[i][j], a);
            if (j + 1 <= m) add(bh[i][j + 1], bh[i][j], b);
            else add(s, bh[i][j], b);
            add(wh[i][j], t, a);
            if (j + 1 <= m) add(wh[i][j], wh[i][j + 1], b);
            else add(wh[i][j], t, b);
            add(bs[i][j], t, a);
            if (i + 1 <= n) add(bs[i][j], bs[i + 1][j], b);
            else add(bs[i][j], t, b);
            add(s, ws[i][j], a);
            if (i + 1 <= n) add(ws[i + 1][j], ws[i][j], b);
            else add(s, ws[i][j], b);
            if (ch == '.') {
                add(ws[i][j], bh[i][j], c); add(bs[i][j], wh[i][j], c); 
                add(bs[i][j], bh[i][j], inf);
            } else {
                add(bh[i][j], bs[i][j], c);
                add(s, ws[i][j], inf); add(wh[i][j], t, inf);
            }
        }
    while (BFS()) ans += dinic(s, inf);
    std::cout << ans;
    return 0;
}