#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 10;
const int C = 18;

string vec[N][N];
int maskInRow[N][N][N], maskInCol[N][N][N];
int score[C][C];
int dp[1 << C];
vector<pair<int, int>> objects;

int calculateDP(int mask)
{
	if (dp[mask] != -1)
		return dp[mask];
	int c = SZ(objects);
	dp[mask] = 0;
	FOR(i, 0, c)
	{
		if (((mask >> i) & 1) == 0)
			continue;
		FOR(j, i + 1, c)
		{
			if (((mask >> j) & 1) == 0)
				continue;
			auto [r1, c1] = objects[i];
			auto [r2, c2] = objects[j];
			int maskIJ = (1 << i) | (1 << j);
			if (((maskInRow[r1][c1][c2] | maskInCol[c2][r1][r2]) & mask) == maskIJ || ((maskInCol[c1][r1][r2] | maskInRow[r2][c1][c2]) & mask) == maskIJ)
			{
				dp[mask] = max(dp[mask], calculateDP(mask ^ (1 << i) ^ (1 << j)) + score[i][j]);
			}
		}
	}
	return dp[mask];
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		int n, m, k;
		cin >> n >> m >> k;
		objects.clear();
		FILL(maskInRow, 0);
		FILL(maskInCol, 0);
		FILL(dp, -1);
		FOR(i, 0, n)
			FOR(j, 0, m)
			{
				cin >> vec[i][j];
				if (vec[i][j][0] != '-')
				{
					maskInRow[i][j][j] = 1 << SZ(objects);
					maskInCol[j][i][i] = 1 << SZ(objects);
					objects.emplace_back(i, j);
				}
			}
		FOR(i, 0, n) FOR(l, 0, m) FOR(r, l + 1, m)
			maskInRow[i][r][l] = maskInRow[i][l][r] = maskInRow[i][l][r - 1] | maskInRow[i][r][r];
		FOR(j, 0, m) FOR(l, 0, n) FOR(r, l + 1, n)
			maskInCol[j][r][l] = maskInCol[j][l][r] = maskInCol[j][l][r - 1] | maskInCol[j][r][r];
		vector<int> s(k + 1);
		for (int& si : s)
			cin >> si;
		FOR(i, 0, SZ(objects))
			FOR(j, i + 1, SZ(objects))
			{
				score[i][j] = 0;
				int cnt = 0;
				FOR(l, 0, k)
					if (vec[objects[i].first][objects[i].second][l] == vec[objects[j].first][objects[j].second][l])
						cnt++;
				score[i][j] = s[cnt];
			}
		dp[0] = 0;
		cout << calculateDP((1 << SZ(objects)) - 1) << "\n";
	}
}