#include <cstdint>
#include <iostream>
#include <utility>
#include <functional>
#include <vector>
#include <queue>
#include <ranges>

using i64 = std::int64_t;

constexpr std::pair<int, int> DIRS4[] = {
	{ -1, 0 },
	{ 0, 1 },
	{ 1, 0 },
	{ 0, -1 }
};

template<class T, class Comp>
using priority_queue = std::priority_queue<T, std::vector<T>, Comp>;

signed main() {
	int n; std::cin >> n;
	std::vector<i64> h(n * n);
	std::vector<std::string> s(n);
	std::vector<i64> a(n * n), b(n * n);
	
	for(auto& v : h) std::cin >> v;
	for(auto& v : s) std::cin >> v;
	for(const auto i : std::views::iota(0, n - 1)) {
		for(const auto j : std::views::iota(0, n)) {
			std::cin >> a[i * n + j];
		}
	}
	for(const auto i : std::views::iota(0, n)) {
		for(const auto j : std::views::iota(0, n - 1)) {
			std::cin >> b[i * n + j];
		}
	}

	auto parity = [&](const int p) {
		return ((p / n) + p % n) % 2;
	};

	auto cost = [&](const auto mode, const auto p, const auto q, const auto d) {
		const auto v = std::min(p, q);
		const auto k = d % 2 == 0 ? a[v] : b[v];
		const auto s = h[p] + h[q];
		return k * std::abs(s) + ((parity(p) + mode) % 2 * 2 - 1) * s;
	};

	std::vector<i64> sup(n * n, -(1UL << 60));
	for(const auto mode : std::views::iota(0, 2)) {
		priority_queue<std::pair<i64, int>, std::greater<>> que;
		std::vector<i64> dist(n * n, 1UL << 60);

		for(const auto i : std::views::iota(0, n * n)) {
			if(s[i / n][i % n]	== '=') {
				que.emplace(0, i);
			}

			if(parity(i) == mode) {
				if(s[i / n][i % n] == '+') que.emplace(0, i);
			}
			else {
				if(s[i / n][i % n] == '-') que.emplace(0, i);
			}
		}

		while(!que.empty()) {
			const auto [ d, v ] = que.top(); que.pop();
			if(d >= dist[v]) continue;
			dist[v] = d;

			const int i = v / n, j = v % n;

			for(const int t : std::views::iota(0, 4)) {
				const int ni = i + DIRS4[t].first, nj = j + DIRS4[t].second;
				if(ni < 0 || nj < 0 || ni >= n || nj >= n) continue;

				const int nv = ni * n + nj;
				const i64 nd = d + cost(mode, v, nv, t);
				if(nd >= dist[nv]) continue;

				que.emplace(nd, nv);
			}
		}
		
		for(const int i : std::views::iota(0, n * n)) {
			const auto v = h[i] + (parity(i) * 2 - 1) * dist[i];
			if(sup[i] < v) sup[i] = v;
		}
	}

	int q; std::cin >> q;
	for(const auto _ : std::views::iota(0, q)) {
		int r, c; std::cin >> r >> c; --r, --c;
		i64 e; std::cin >> e;
		std::cout << (sup[r * n + c] >= e - 1 ? "Yes" : "No") << "\n";
	}
}