#include<bits/stdc++.h>
using namespace std;
using ll = long long;

struct DSU {
	vector<int> f;
	DSU(int n) : f(n + 1) {
		for (int i = 1; i <= n; i++) {
			f[i] = i;
		}
	}
	int getfa(int v) {
		return f[v] == v ? v : (f[v] = getfa(f[v]));
	}
	bool merge(int u, int v) {
		u = getfa(u), v = getfa(v);
		if (u == v) {
			return false;
		}
		f[u] = v;
		return true;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<string> mp(n);
	vector id(n, vector(m, array<int, 4>{0, 0, 0, 0}));
	for (int i = 0; i < n; i++) {
		cin >> mp[i];
	}
	vector c(n, vector(m, 0));
	int idc = 0;
	vector<tuple<int, int, int>> e;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> c[i][j];
			if (i > 0) {
				id[i][j][0] = id[i - 1][j][3];
			}
			if (j > 0) {
				id[i][j][1] = id[i][j - 1][2];
			}
			if (j < m - 1) {
				id[i][j][2] = ++idc;
			}
			if (i < n - 1) {
				id[i][j][3] = ++idc;
			}
			if (mp[i][j] == '/') {
				e.emplace_back(0, id[i][j][0], id[i][j][1]);
				e.emplace_back(0, id[i][j][2], id[i][j][3]);
				e.emplace_back(c[i][j], id[i][j][0], id[i][j][2]);
				e.emplace_back(c[i][j], id[i][j][1], id[i][j][3]);
			} else {
				e.emplace_back(0, id[i][j][0], id[i][j][2]);
				e.emplace_back(0, id[i][j][1], id[i][j][3]);
				e.emplace_back(c[i][j], id[i][j][0], id[i][j][1]);
				e.emplace_back(c[i][j], id[i][j][2], id[i][j][3]);
			}
		}
	}
	sort(e.begin(), e.end());
	DSU dsu(idc);
	ll ans = 0;
	for (auto [len, x, y] : e) {
		if (dsu.merge(x, y)) {
			ans += len;
		}
	}
	cout << ans << '\n';
	return 0;
}