#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>

#define LL  long long
#define REP(i, n) for(int i = 0;i < (int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

struct P{
	int x,y;
	P(){}
};

struct Node{
	int next,prev,cost;
	Node(int n,int p,int c){
		next = n;
		prev = p;
		cost = c;
	}
};

int DY[4] = {-1,0,1,0};
int DX[4] = {0,1,0,-1};

int H,W,M;
vector<P> pos;
vector<string> field;
int con[50][50];
int on[50][50];
int off[50][50];

int trace[50][50];

bool isValid(int x,int y){
	return x>=0 && y>=0 && x<W && y<H;
}

int bfs(P s,P e){
	memset(trace,-1,sizeof(trace));
	queue<Node> q;q.push(Node(s.y*W+s.x,-2,0));
	while(!q.empty()){
		Node n = q.front();q.pop();
		int cy = n.next/W;
		int cx = n.next%W;
		if(trace[cy][cx]!=-1)continue;
		trace[cy][cx] = n.prev;
		if(cx==e.x && cy==e.y)return n.cost;
		REP(i,4){
			int ny = cy+DY[i];
			int nx = cx+DX[i];
			if(isValid(nx,ny)){
				if(field[ny][nx]=='#')continue;
				q.push(Node(ny*W+nx,n.next,n.cost+1));
			}
		}
	}
}

vector<int> visited[50][50];

void add(P e,int &now){
	int nx = e.x,ny = e.y;
	vector<int> tmp;
	while(true){
		tmp.push_back(ny*W+nx);
		int prev = trace[ny][nx];
		if(prev==-2)break;
		ny = prev/W;
		nx = prev%W;
	}
	REP(i,tmp.size()-1){
		int t = tmp[tmp.size()-1-i];
		visited[t/W][t%W].push_back(now++);
	}
}

int calcDP(int x,int y){
	const vector<int> &visit = visited[y][x]; 
	if(visit.size()==0)return 0;
	int n = visit.size();
	vector<vector<int> > dp(n+1,vector<int>(2));
	int conCost = con[y][x];
	int onCost = on[y][x];
	int offCost = off[y][x];
	dp[0][0] = onCost+offCost;
	dp[0][1] = onCost;
	for(int i=1 ; i<n ; i++){
		int dist = visit[i]-visit[i-1];
		REP(t,2){
			int tmp = min(dp[i-1][0]+onCost,dp[i-1][1]+dist*conCost);
			if(t==0)tmp+=offCost;
			dp[i][t] = tmp;
		}
	}
	return dp[n-1][0];
}

int main(){
	while(~scanf("%d%d%d",&H,&W,&M)){
		field.assign(H,"");
		REP(i,H){
			char buf[64];
			scanf("%s",buf);
			field[i] = string(buf);
		}
		REP(y,H)REP(x,W)scanf("%d",&con[y][x]);
		REP(y,H)REP(x,W)scanf("%d",&on[y][x]);
		REP(y,H)REP(x,W)scanf("%d",&off[y][x]);
		pos.assign(M,P());
		REP(i,M){
			scanf("%d%d",&pos[i].y,&pos[i].x);
		}
		int now = 0;
		REP(y,H)REP(x,W)visited[y][x].clear();
		REP(i,M-1){
			bfs(pos[i],pos[i+1]);
			add(pos[i+1],now);
		}
		visited[pos[M-1].y][pos[M-1].x].push_back(now);
		//REP(y,H)REP(x,W){
		//	cout << "pos:" << y << "," << x << endl;
		//	REP(i,visited[y][x].size())cout << visited[y][x][i] << " ";
		//	cout << endl;
		//}
		int res = 0;
		REP(y,H)REP(x,W)res += calcDP(x,y);
		printf("%d\n",res);
	}
	return 0;
}