#include <bits/stdc++.h>
#define N 20
using namespace std;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

string ss[100];

int mp[N][N], w[N][N], v[N];

int r[N][N][N], c[N][N][N], f[1 << 18];

int x[N], y[N];

void work() {
    int n = rd();
    int m = rd();
    int K = rd();
    int idcnt = -1;
    string s;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j) {
            cin >> s;
            if (s[0] == '-') mp[i][j] = -1;
            else {
                mp[i][j] = ++idcnt;
                ss[idcnt] = s;
                x[idcnt] = i;
                y[idcnt] = j;
            }
        }
    for (int i =0; i <= K; ++i) v[i] = rd();
    for (int i = 0; i <= idcnt; ++i)
        for (int j = 0; j <= idcnt; ++j) {
            w[i][j] = 0;
            for (int k = 0; k < K; ++k) w[i][j] += (ss[i][k] == ss[j][k]);
            w[i][j] = v[w[i][j]];
        }
    memset(r, 0, sizeof(r));
    memset(c, 0, sizeof(c));
    for (int x = 1; x <= n; ++x)
        for (int y = 1; y <= m; ++y) {
            if (mp[x][y] == -1) continue;
            //go left
            for (int t = y - 1; t; --t)
                r[x][y][t] = r[x][y][t + 1] + (mp[x][t] >= 0 ? (1 << mp[x][t]) : 0);
            //go right
            for (int t = y + 1; t <= m; ++t)
                r[x][y][t] = r[x][y][t - 1] + (mp[x][t] >= 0 ? (1 << mp[x][t]) : 0);
            //go up
            for (int t = x - 1; t; --t)
                c[x][y][t] = c[x][y][t + 1] + (mp[t][y] >= 0 ? (1 << mp[t][y]) : 0);
            //go down
            for (int t = x + 1; t <= n; ++t)
                c[x][y][t] = c[x][y][t - 1] + (mp[t][y] >= 0 ? (1 << mp[t][y]) : 0);
        }
    int S = (1 << (idcnt + 1)) - 1;
    memset(f, 0xcf, sizeof(f));
    f[0] = 0;
    for (int s = 0; s <= S; ++s) {
        for (int i = 0; i <= idcnt; ++i) {
            if (s & (1 << i)) continue;
            for (int j = i + 1; j <= idcnt; ++j) {
                if (s & (1 << j)) continue;
                bool fl = 0;

                int ts = (s | ((1 << i) | (1 << j)));
                int xa = x[i], ya = y[i];
                int xb = x[j], yb = y[j];
                int tars = (r[xa][ya][yb] | c[xb][yb][xa]);
                if ((ts & tars) == tars) fl = 1;
                tars = (r[xb][yb][ya] | c[xa][ya][xb]);
                if ((ts & tars) == tars) fl = 1;

                if (fl) {
                   // printf("%d -> %d %d %d %d + %d\n", s, ts, i, j, f[s], w[i][j]);
                    f[ts] = max(f[ts], f[s] + w[i][j]);
                }
            }
        }
    }
    printf("%d\n", f[S]);
}

int main() {
    for (int t = rd(); t; t--) work();
    return 0;
}

/*
1
2 2 3
aaa aaa
bbb bbb
1 10 100 1000
*/