#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define cmx(x,y) x = max(x,y)
#define cmn(x,y) x = min(x,y)
#define ary(k) array<int,k>
typedef pair<int,int> pii;
typedef vector<int> vi;
const int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};
void solve(){
	int n; cin >> n;
	vector<vi> g(n,vi(n)),p(n,vi(n));
	rep(i,0,n){
		rep(j,0,n){
			cin >> g[i][j];
		}
	}
	vi we(n*n),len(n*n),cnt(n*n);
	rep(i,0,n){
		rep(j,0,n){
			cin >> p[i][j];
		}
	}
	rep(i,0,n){
		rep(j,0,n){
			we[p[i][j]] += g[i][j];	
			cnt[p[i][j]]++;
			rep(k,0,4){
				int x = i + dx[k], y = j + dy[k];
				if(x < 0 || x >= n || y < 0 || y >= n) continue;
				if(p[x][y] != p[i][j]) len[p[i][j]]++;
			}
		}
	}
	map<int,multiset<int>> mp;
	auto add = [&](int i){
		mp[len[i]].insert(we[i]);
	};
	auto rmv = [&](int i){
		mp[len[i]].erase(mp[len[i]].find(we[i]));
		if(mp[len[i]].empty()) mp.erase(len[i]);
	};
	rep(i,0,n*n)if(cnt[i]){
		add(i);
	}
	int q; cin >> q; rep(_,0,q){
		int x,y,z,A,B,C; cin >> x >> y >> z >> A >> B >> C;
		x--; y--; int oz = p[x][y];
		cnt[oz]--;
		rmv(oz);	
		// remove contrib to oz
		rep(k,0,4){
			int nx = x + dx[k], ny = y + dy[k];
			if(nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
			if(p[nx][ny] != oz) len[oz]--;	
			if(p[nx][ny] == oz) len[oz]++;
		}
		we[oz] -= g[x][y];
		if(cnt[oz]) add(oz);

		p[x][y] = z;

		if(cnt[z]) rmv(z);
		// add contrib to oz
		rep(k,0,4){
			int nx = x + dx[k], ny = y + dy[k];
			if(nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
			if(p[nx][ny] != z) len[z]++;
			if(p[nx][ny] == z) len[z]--;
		}
		we[z] += g[x][y];
		cnt[z]++;
		add(z);
		//rep(i,0,n*n) cout << i << " " << we[i] << " " << len[i] << "\n";		
		int ans = -1e18;
		for(auto&[b,v]:mp){
			int a = *v.rbegin();
			ans = max(ans,A*a+B*b+C*a*b);
			a = *v.begin();
			ans = max(ans,A*a+B*b+C*a*b);
		}
		cout << ans << " \n"[_==q-1];
	}
}
signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	int t; cin >> t; while(t--) solve();
}