#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m;
char mp[N][N];
int fa[N * N];
inline int Ask(int x) {
    return fa[x] ? fa[x] = Ask(fa[x]) : x;
}
inline int Id(int x, int y) {
    return (x - 1) * (m + 1) + y;
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%s", mp[i] + 1);
    vector<tuple<int, int, int>> ed;
    int ans = 0;
    for (int i = 1, z; i <= n; ++i)
        for (int j = 1; j <= m; ++j) {
            scanf("%d", &z);
            if (mp[i][j] == '/') {
                int x = Id(i + 1, j);
                int y = Id(i, j + 1);
                ed.push_back({z, x, y});
            } else {
                int x = Id(i, j);
                int y = Id(i + 1, j + 1);
                ed.push_back({z, x, y});
            }
            ans += z;
        }
    sort(ed.begin(), ed.end());
    reverse(ed.begin(), ed.end());
    for (auto [z, x, y] : ed) {
        x = Ask(x); y = Ask(y);
        if (x != y) fa[x] = y, ans -= z;
    }
    printf("%d\n", ans);
    return 0;
}