#include <bits/stdc++.h>
typedef long long LL;
typedef __int128 LLL;
typedef unsigned long long ULL;
typedef std::pair<int, int> pii;
typedef std::string Str;
#define fi first
#define se second
#define MP std::make_pair
#define clr(f, n) memset(f, 0, (n) << 2)
#define cpy(f, g, n) memcpy(f, g, (n) << 2)
#define rev(f, n) std::reverse(f, (f) + (n))
int read()
{
    int s = 0; int f = 1;
    char c = getchar();
    while (!(c >= '0' && c <= '9'))
        f ^= (c == '-'), c = getchar();
    while (c >= '0' && c <= '9')
        s = s * 10 + (c ^ 48), c = getchar();
    return f ? s : -s;
}
const int MAXN = 2005;
const int MOD = 998244353, inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> T& Fmin(T& x, T y){ return x = x < y ? x : y; }
template<typename T> T& Fmax(T& x, T y){ return x = x < y ? y : x; }
auto fplus = [](int x, int y){ return x + y >= MOD ? x + y - MOD : x + y; };
auto fminus = [](int x, int y){ return x >= y ? x - y : x + MOD - y; };
auto Fplus = [](int &x, int y){ return x = fplus(x, y); };
auto Fminus = [](int &x, int y){ return x = fminus(x, y); };
int fpow(int x, int y = MOD - 2)
{
    int res = 1;
    for (; y; y >>= 1, x = (LL)x * x % MOD)
        if (y & 1) res = (LL)res * x % MOD;
    return res;
}   
namespace DSU
{
	int fa[MAXN];
	void init(int n)
	{ std::iota(fa + 1, fa + n + 1, 1); }
	int getF(int x){ return x == fa[x] ? x : (fa[x] = getF(fa[x])); }
	bool merge(int x, int y)
	{
		x = getF(x), y = getF(y);
		if (x == y) return false;
		fa[x] = y; return true;
	}
}
std::vector<pii> e[MAXN];
int n, m, Q, p[MAXN], cnt[MAXN], dis[MAXN][MAXN];
char s[10004];
void Dijkstra(int s)
{
	static bool vis[MAXN];
	static std::priority_queue<pii, std::vector<pii>, std::greater<pii> > q;
	memset(dis[s] + 1, 0x3f, n << 2);
	memset(vis + 1, false, n);
	q.emplace(dis[s][s] = 0, s);
	while (!q.empty())
	{
		int x = q.top().se; q.pop();
		if (vis[x]) continue;
		vis[x] = true;
		for (pii y : e[x])
			if (std::max(dis[s][x], y.se) < dis[s][y.fi])
				q.emplace(dis[s][y.fi] = std::max(dis[s][x], y.se), y.fi);
	} 
}
void mian()
{
	n = read(), m = read(), Q = read();
	DSU::init(n);
	for (int i = 1; i <= m; i++)
	{
		scanf("%s", s);
		memset(cnt + 1, 0, n << 2);
		for (int j = 1; j <= n; j++) 
			cnt[p[j] = 50 * (s[j * 2 - 2] - 48) + (s[j * 2 - 1] - 48)]++;
		int X = 0, Y = 0;
		for (int j = 1; j <= n && X != -1; j++)
			if (cnt[j] > 2) X = -1;
			else if (cnt[j] == 2)
			{
				if (X) X = -1;
				else X = j;
			}
			else if (!cnt[j]) Y = j;
//		printf("%d: %d %d\n", i, X, Y);
		if (X == -1) continue;
		for (int j = 1; j <= n; j++)
			if (!X && DSU::merge(j, p[j]))
				e[j].emplace_back(p[j], i), e[p[j]].emplace_back(j, i);
			else if (X == p[j]) e[j].emplace_back(Y, i);
	}
	for (int i = 1; i <= n; i++) Dijkstra(i);
	for (int i = 1; i <= Q; i++)
	{
		scanf("%s", s);
		int a = (s[0] - 48) * 50 + s[1] - 48;
		int b = (s[2] - 48) * 50 + s[3] - 48;
		int c = (s[4] - 48) * 50 + s[5] - 48;
//		printf("%d %d %d\n", a, b, c);
		putchar(dis[a][b] <= c ? '1' : '0');
//		putchar('\n');
	}
	putchar('\n');
	for (int i = 1; i <= n; i++) e[i].clear();
}
int main()
{
	for (int T = read(); T--; ) mian(); 
	return 0;	
}