#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001 * 4;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
template<class R> auto ComparingBy(R f){ return [g=std::move(f)](auto l, auto r) -> bool { return g(l) < g(r); }; }
#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    i64 N; cin >> N;
    vector<i64> H(N*N);
    rep(i,N*N) cin >> H[i];
    vector<int> ud(N*N);
    rep(i,N){
        string x; cin >> x;
        rep(j,N) ud[i*N+j] = int(string("=+-?").find(x[j]));
    }
    vector<i64> A(N*N), B(N*N);
    rep(i,N-1) rep(j,N){ i64 a; cin >> a; A[i*N+j] = a * abs(H[i*N+j] + H[i*N+j+N]); }
    rep(i,N) rep(j,N-1){ i64 a; cin >> a; B[i*N+j] = a * abs(H[i*N+j] + H[i*N+j+1]); }
    i64 Q; cin >> Q;
    vector<int> parity(N*N);
    rep(i,N) rep(j,N) parity[i*N+j] = (i+j)%2;
    struct Query { i64 i; i64 e; i64 parity; i64 ans; };
    vector<Query> queries(Q);
    rep(i,Q){
        i64 r,c,e; cin >> r >> c >> e; r--; c--;
        queries[i] = { r*N+c, e-H[r*N+c], (r+c)%2, 0 };
    }
    rep(t,2){
        vector<vector<pair<i64,i64>>> adj(N*N);
        rep(i,N) rep(j,N){
            i64 p = i * N + j;
            if(j != N-1){
                i64 d = H[p] + H[p+1]; if(parity[p]) d = -d;
                adj[p].push_back({ p+1, B[p] + d });
                adj[p+1].push_back({ p, B[p] - d });
            }
            if(i != N-1){
                i64 d = H[p] + H[p+N]; if(parity[p]) d = -d;
                adj[p].push_back({ p+N, A[p] + d });
                adj[p+N].push_back({ p, A[p] - d });
            }
        }
        vector<i64> dist(N*N, INF);
        nega_queue<pair<i64,i64>> que;
        auto see = [&](i64 p, i64 d){
            if(dist[p] <= d) return;
            dist[p] = d;
            que.push({ d, p });
        };
        rep(i,N*N) if(!(ud[i] & (1 << parity[i]))) see(i, 0);
        while(que.size()){
            auto [d,p] = que.top(); que.pop();
            if(dist[p] != d) continue;
            for(auto [to,e] : adj[p]){
                //cout << "p = " << p << " , to = " << to << " , e = " << e << endl;
                see(to, d+e);
            }
        }
        //rep(i,N){ rep(j,N){
        //    i64 h = dist[i*N+j];
        //    if(parity[i*N+j]) h *= -1;
        //    h += H[i*N+j];
        //    cout << h << " ";
        //} cout << endl; }
        for(auto& q : queries) if(q.parity == t){
            //cout << "dist = " << dist[q.i] << endl;
            //cout << "e = " << q.e << endl;
            q.ans = (q.e <= dist[q.i] ? 1 : 0);
        }
        rep(i,N*N) parity[i] ^= 1;
    }
    rep(i,Q) cout << yn(queries[i].ans) << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}