#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
constexpr int inf = 1e9;
int to[300005], cap[300005], tot, vcnt, d[300005], cur[300005];
std::vector<int> e[300005];
void link(int u, int v, int c) {
    to[tot] = v, cap[tot] = c, e[u].push_back(tot++);
    to[tot] = u, cap[tot] = 0, e[v].push_back(tot++);
}
int bfs(int s, int t) {
    static std::queue<int> q;
    q.push(s);
    for (int i = 1; i <= vcnt; i++) d[i] = 0;
    d[s] = 1;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int i : e[u]) {
            if (!cap[i]) continue;
            int v = to[i];
            if (d[v]) continue;
            d[v] = d[u] + 1, q.push(v);
        }
    }
    return d[t];
}
int dfs(int u, int t, int flow) {
    if (u == t) return flow;
    if (!flow) return 0;
    int pushed = 0;
    for (int &_i = cur[u]; _i != e[u].size(); _i++) {
        int i = e[u][_i];
        int v = to[i];
        if (d[v] != d[u] + 1 || !cap[i]) continue;
        int x = dfs(v, t, std::min(flow - pushed, cap[i]));
        pushed += x, cap[i] -= x, cap[i ^ 1] += x;
        if (pushed == flow) return pushed;
    }
    return pushed;
}
int n, m, br[55][55], wr[55][55], bc[55][55], wc[55][55], a, b, c, ans;
int main() {
    std::cin >> n >> m >> a >> b >> c;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            br[i][j] = ++vcnt;
            wr[i][j] = ++vcnt;
            bc[i][j] = ++vcnt;
            wc[i][j] = ++vcnt;
        }
    }
    int s = ++vcnt, t = ++vcnt;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            link(wr[i][j], br[i][j], inf);
            link(bc[i][j], wc[i][j], inf);
            if (i != n) {
                link(wc[i][j], wc[i + 1][j], b);
                link(bc[i + 1][j], bc[i][j], b);
            }
            if (j != m) {
                link(br[i][j], br[i][j + 1], b);
                link(wr[i][j + 1], wr[i][j], b);
            }
            if (i == 1) {
                link(s, wc[i][j], b);
                link(bc[i][j], t, b);
            }
            if (j == 1) {
                link(s, br[i][j], b);
                link(wr[i][j], t, b);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char ch; std::cin >> ch;
            if (ch == '#') {
                link(s, br[i][j], a);
                link(s, wc[i][j], inf);
                link(wr[i][j], t, inf);
                link(bc[i][j], t, a);
                link(br[i][j], bc[i][j], c);
            } else {
                link(s, br[i][j], a);
                link(s, wc[i][j], a);
                link(wr[i][j], t, a);
                link(bc[i][j], t, a);
                link(bc[i][j], br[i][j], inf);
                link(wc[i][j], br[i][j], c);
                link(bc[i][j], wr[i][j], c);
            }
        }
    }
    while (bfs(s, t)) {
        for (int i = 1; i <= vcnt; i++) cur[i] = 0;
        ans += dfs(s, t, inf);
    }
    std::cout << ans << std::endl;
}