#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge {
    int u, v, w;
    bool operator<(const Edge &rhs) const {
        return w < rhs.w;
    }
};
vector<Edge> E;
void add_edge(int u, int v, int w) {
    E.push_back({u, v, w});
}
string s[1000];
int c[1000][1000];
struct DSU {
    vector<int> f;
    void init(int n) {
        f.resize(n + 1);
        iota(f.begin(), f.end(), 0);
    }
    int root(int x) {
        return f[x] == x ? x : f[x] = root(f[x]);
    }
    bool conn(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        f[x] = y;
        return true;
    }
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    const int V = n * m * 2 + n + m;
    auto mapv = [=](int x, int y, int d) {
        if (d == 2) {
            if (y == 0) return n * m * 2 + x;
            d = 0, --y;
        }
        if (d == 3) {
            if (x == 0) return n * m * 2 + n + y;
            d = 1, --x;
        }
        return (x * m + y) * 2 + d;
    };
    for (int i = 0; i < n; ++i) cin >> s[i];
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> c[i][j];
        }
    }
    for (int i = 0; i < n; ++i) {
        add_edge(mapv(i, 0, 2), V, 0);
        add_edge(mapv(i, m - 1, 0), V, 0);
    }
    for (int i = 0; i < m; ++i) {
        add_edge(mapv(0, i, 3), V, 0);
        add_edge(mapv(n - 1, i, 1), V, 0);
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            const int p[] = {mapv(i, j, 0), mapv(i, j, 1), mapv(i, j, 2), mapv(i, j, 3)};
            if (s[i][j] == '\\') {
                add_edge(p[0], p[1], c[i][j]);
                add_edge(p[2], p[3], c[i][j]);
                add_edge(p[0], p[3], 0);
                add_edge(p[2], p[1], 0);
            } else {
                add_edge(p[0], p[1], 0);
                add_edge(p[2], p[3], 0);
                add_edge(p[0], p[3], c[i][j]);
                add_edge(p[2], p[1], c[i][j]);
            }
        }
    }
    sort(E.begin(), E.end());
    DSU dsu;
    dsu.init(V);
    ll ans = 0;
    for (const auto &e : E) {
        if (dsu.conn(e.u, e.v)) {
            ans += e.w;
        }
    }
    cout << ans << endl;
    return 0;
}