#include<bits/stdc++.h>
using namespace std;
int w[505][505],p[505][505];
int n,q;
int sum[250005],l[250005],cnt[250005];
vector<int> sb[250005];
typedef long long ll;
inline void solve(){
    cin>>n;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++) cin>>w[i][j];
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++) cin>>p[i][j];
    for(int i=1;i<=n*n;i++) sum[i]=l[i]=cnt[i]=0,sb[i].clear();
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
        sum[p[i][j]]+=w[i][j];cnt[p[i][j]]++;
        if(i<n)
            if(p[i][j]!=p[i+1][j]) l[p[i][j]]++,l[p[i+1][j]]++;
        if(j<n)
            if(p[i][j]!=p[i][j+1]) l[p[i][j]]++,l[p[i][j+1]]++;
    }cin>>q;
    unordered_set<int> v;
    for(int i=1;i<=n*n;i++)if(cnt[i])v.insert(l[i]),sb[l[i]].push_back(sum[i]);
    while(q--){
        int x,y,z;ll A,B,C;cin>>x>>y>>z>>A>>B>>C;
        auto del=[&](int z){
            int a=l[z],b=sum[z];
            if(!cnt[z]) return;
            // cout<<"DEL "<<z<<' '<<a<<' '<<b<<'\n';
            assert(!sb[a].empty());
            assert(v.count(a));
            sb[a].erase(lower_bound(sb[a].begin(),sb[a].end(),b));
            if(sb[a].empty()) v.erase(a);
        };
        auto add=[&](int z){
            int a=l[z],b=sum[z];
            if(!cnt[z]) return;
            // cout<<"ADD "<<z<<' '<<a<<' '<<b<<'\n';
            sb[a].insert(upper_bound(sb[a].begin(),sb[a].end(),b),b);
            if(sb[a].size()==1) v.insert(a);
        };
        if(z!=p[x][y]){
            int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
            int w=p[x][y];
            for(int d=0;d<4;d++){
                int xx=x+dx[d],yy=y+dy[d];
                if(xx<1||yy<1||xx>n||yy>n) continue;
                del(p[xx][yy]);
                if(w!=p[xx][yy])l[p[xx][yy]]--;
                if(z!=p[xx][yy])l[p[xx][yy]]++;
                add(p[xx][yy]);
            }
            del(w),del(z);
            for(int d=0;d<4;d++){
                int xx=x+dx[d],yy=y+dy[d];
                if(xx<1||yy<1||xx>n||yy>n) continue;
                if(w!=p[xx][yy])l[w]--;
                if(z!=p[xx][yy])l[z]++;
            }cnt[w]--,cnt[z]++;
            sum[w]-=::w[x][y];
            add(w);
            p[x][y]=z;
            sum[z]+=::w[x][y];
            add(z);
        }
        ll ans=-1e18;
        // for(int i=1;i<=n*n;i++) cout<<i<<' '<<l[i]<<' '<<sum[i]<<'\n';
        for(auto x:v){
            ll d=A+C*x;
            // cout<<x<<' '<<sb[x].size()<<'\n';
            assert(!sb[x].empty());
            if(d<0)ans=max(ans,B*x+d*sb[x][0]);
            else ans=max(ans,B*x+d*sb[x].back());
        }
        cout<<ans<<'\n';
    }
}
int main(){
    int t;cin>>t;
    while(t--) solve();
}