#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

struct DSU {
	vector<int> fa;
	DSU(int n = 0) {
		fa.resize(n + 1);
		iota(fa.begin() + 1, fa.end(), 1);
	}
	int find(int x) {
		return fa[x] == x ? x : fa[x] = find(fa[x]);
	}
};

struct Bitset {
	int len;
	vector<ll> w;
	Bitset(int n = 0) {
		len = (n + 64) / 64;
		w.resize(len);
	}
	void set(int x) {
		w[x / 64] |= 1ll << x % 64;
	}
	int get(int x) {
		return w[x / 64] >> x % 64 & 1;
	}
};


void solve() {
	int n, l, q; cin >> n >> l >> q;
	vector<vector<Bitset>> bts;
	vector<vector<int>> g(n + 1), ids;
	vector<int> dfn, low, stk, ins, id(n + 1);
	for (int j = 1; j <= n; ++j) id[j] = j;
	vector<vector<int>> scc;
	int ts, top, scc_cnt = n;
	function<void(int)> tarjan = [&](int u) {
		dfn[u] = low[u] = ++ts;
		stk[++top] = u, ins[u] = 1;
		for (int v: g[u]) 
			if (!dfn[v]) {
				tarjan(v);
				low[u] = min(low[u], low[v]);
			}
			else if (ins[v]) low[u] = min(low[u], dfn[v]);
		if (dfn[u] == low[u]) {
			++scc_cnt;
			int y;
			do {
				y = stk[top--];
				ins[y] = 0;
				id[y] = scc_cnt;
				scc[scc_cnt].emplace_back(y);
			} while (y != u);
		}
	};
	vector<pii> edges;
	for (int i = 0; i < l; ++i) {
		string s; cin >> s;
		vector<int> a(n + 1), deg(n + 1);
		int t = 0;
		for (int j = 0, k = 1; j < n * 2; j += 2, ++k) {
			a[k] = (s[j] - '0') * 50 + s[j + 1] - '0';
			++deg[a[k]];
			t += deg[a[k]] > 1;
		}
		if (t >= 2) {
			if (!i) {
				vector<Bitset> Bt;
				Bitset bt(scc_cnt + 1);
				for (int j = 0; j <= scc_cnt; ++j) {
					Bt.emplace_back(bt);
					if (j) Bt[j].set(j);
				}
				ids.emplace_back(id);
				bts.emplace_back(Bt);
				continue;
			}
			ids.emplace_back(ids.back());
			bts.emplace_back(bts.back());
			continue;
		}
		g = vector<vector<int>>(n + 1);
		if (!t) {
			for (int j = 1; j <= n; ++j) {
				if (id[j] != id[a[j]]) 
					g[id[j]].emplace_back(id[a[j]]);
				// debug(j);
				// debug(a[j]);
				// debug(id[j]);
				// debug(id[a[j]]);
			}
		} else {
			int x;
			for (int j = 1; j <= n; ++j) {
				if (!deg[j]) {
					x = j;
					break;
				}
			}
			int y = x;
			for (;;) {
				int p = a[y];
				if (deg[p] > 1) break;
				y = p;
			}
			if (id[y] != id[x]) edges.emplace_back(id[y], id[x]);
			y = a[y];
			int z = y;
			do {
				int p = a[z];
				if (p == y) break;
				// g[id[z]].emplace_back(id[p]);
				z = p;
			} while (1);
			y = z;
			// g[id[x]].emplace_back(id[y]);
			if (id[y] != id[x]) edges.emplace_back(id[y], id[x]);
			// debug(i);
			// debug(x), debug(y);
			// debug(id[x]), debug(id[y]);
		}
		for (auto[x, y]: edges) g[x].emplace_back(y);
		// continue;
		dfn = vector<int>(n + 1), low = vector<int>(n + 1), stk = vector<int>(n + 1), ins = vector<int>(n + 1), id = vector<int>(n + 1);
		scc = vector<vector<int>>(n + 1);
		int sc = scc_cnt;
		ts = top = scc_cnt = 0;
		for (int j = 1; j <= sc; ++j) {
			if (!dfn[j]) tarjan(j);
		}
		vector<Bitset> Bt;
		Bitset bt(scc_cnt + 1);
		for (int j = 0; j <= scc_cnt; ++j) Bt.emplace_back(bt);
		// for (int j = scc_cnt; j; --j) {
		// debug(i);
		for (int j = 1; j <= scc_cnt; ++j) {
			Bt[j].set(j);
			// debug(j);
			set<int> S;
			for (int u: scc[j]) {
				// debug(u);
				// for (int o = 1; o <= sc; ++o) {
				// 	if (i) {
				// 		if (bts[i - 1][u].get(o)) Bt[id[u]].set(id[o]);
				// 	}
				// }
				for (int v: g[u]) {
					// debug(v);
					// debug(id[v]);
					if (S.count(id[v])) continue;
					if (id[v] != j) {
						S.emplace(id[v]);
						for (int o = 0; o < bt.len; ++o) Bt[j].w[o] |= Bt[id[v]].w[o];
					}
				}
			}
		}
		// if (i) debug(Bt[2].get(1));
		// for (int j = 1; j <= sc; ++j) cout << id[j] << " \n"[j == sc];
		vector<int> nid = id;
		for (int j = 1; j <= n; ++j) {
			if (i) {
				// debug(ids[i - 1][j]);
				nid[j] = id[ids[i - 1][j]];
			}
		}
		vector<pii> ee;
		for (auto[x, y]: edges) {
			x = id[x], y = id[y];
			if (x != y) ee.emplace_back(x, y);
		}
		edges = move(ee);
		// debug(i);
		id = move(nid);
		// for (int j = 1; j <= n; ++j) cout << id[j] << " \n"[j == n];
		ids.emplace_back(id);
		bts.emplace_back(Bt);
	}
	while (q--) {
		string s; cin >> s;
		vector<int> v(3);
		for (int j = 0, k = 0; k < 3; j += 2, ++k) {
			v[k] = (s[j] - '0') * 50 + s[j + 1] - '0';
		}
		int a = v[0], b = v[1], c = v[2] - 1;
		if (c == -1) {
			if (a == b) cout << '1';
			else cout << '0';
			continue;
		}
		// debug(a), debug(b);
		// debug(c);
		// debug(ids.size());
		// debug(a), debug(b), debug(c);
		// debug(ids[c][a]), debug(ids[c][b]);
		// continue;
		if (bts[c][ids[c][a]].get(ids[c][b])) cout << '1';
		else cout << '0';
	}
	cout << el;
}

// void solve() {
// 	int n, l, q; cin >> n >> l >> q;
// 	vector<DSU> dsu(l);
// 	vector<vector<vector<int>>> g(l);
// 	for (int i = 0; i < l; ++i) {
// 		if (i) dsu[i] = dsu[i - 1];
// 		string s; cin >> s;
// 		vector<int> a(n + 1), deg(n + 1);
// 		int t = 0;
// 		for (int j = 0, k = 1; j < n * 2; j += 2, ++k) {
// 			a[k] = (s[j] - '0') * 50 + s[j + 1] - '0';
// 			++deg[a[k]];
// 			t += deg[a[k]] > 1;
// 		}
// 		if (t >= 2) continue;
// 		if (!t) {
// 			vector<bool> st(n + 1);
// 			for (int j = 1; j <= n; ++j) {
// 				if (st[j]) continue;
// 				int x = j;
// 				vector<int> v;
// 				do {
// 					int u = dsu[i].find(x), v = dsu[i].find(j);
// 					dsu[i].fa[u] = v;
// 					st[x] = 1;
// 					x = a[x];
// 				} while (x != j);
// 			}
// 		}
// 	}
// }

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int tcase = 1;
	cin >> tcase;
	while (tcase--) solve();
}