#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> PII;
#define x first
#define y second
const int N = 2100,M = N+N,INF = 1e18;
vector<PII> adj[N];
int dist[N],p[N];
int find(int x)
{
	if(p[x]!=x) p[x] = find(p[x]);
	return p[x];
}
int ans[N][N];
int n,l,q;
int ne[N],cnt[N];
bool st[N];
void solve() {
	cin>>n>>l>>q;
	for(int i = 1;i<=n;i++) p[i] = i,adj[i].clear();
	for(int i = 1;i<=l;i++)
	{
		string str;
		cin>>str;
		for(int j = 1;j<=n;j++) cnt[j] = 0;
		int pos = 0;
		for(int j=0,k=1;j<str.size();j+=2,k++)
		{
			int x = (str[j]-48)*50+ (str[j+1]-48)%50;
			ne[k] = x;
			cnt[ne[k]]++;
		}
		int num = 0;
		int pos2 = 0;
		for(int j = 1;j<=n;j++) 
		{
			if(!cnt[j]) pos= j;
			if(cnt[j]==2) pos2 = j;
			if(cnt[j]) num++;
		}
		if(num<n-1) continue;
		//cout<<i<<" eee "<<endl;
		if(num==n)
		{
			for(int j = 1;j<=n;j++)
			{
				int u = j,v= ne[j];
				int fu=find(u),fv=find(v);
				if(fu==fv) continue;
				p[fu]=fv;
				adj[u].push_back({v,i});
				adj[v].push_back({u,i});
			}
		}
		else
		{
			for(int j = 1;j<=n;j++)
				if(ne[j]==pos2) adj[j].push_back({pos,i});
		}
	}
	for(int s=1;s<=n;s++)
	{
		for(int j = 1;j<=n;j++)
		{
			st[j] =false;
			ans[s][j] = INF;
			dist[j] =INF;
		} 
		priority_queue<PII,vector<PII>,greater<PII>> heap;
		heap.push({0,s});
		dist[s] = 0;
		while(heap.size())
		{
			PII  t = heap.top();
			heap.pop();
			int d = t.x,u=t.y;
			if(st[u]) continue;
			st[u] = true;
			for(auto& [v,w]: adj[u])
			{
				if(dist[v]>max(d,w))
				{
					dist[v]= max(d,w);
					heap.push({dist[v],v});
				}
			}
		}
		for(int j = 1;j<=n;j++) ans[s][j] =dist[j];
	}
	string r;
	while(q--)
	{
		string str;
		cin>>str;
		int g[5]={0};
		for(int j=0,k=1;j<str.size();j+=2,k++)
		{
			int x = (str[j]-48)*50+ (str[j+1]-48)%50;
			g[k] =x;
			//cout<<k<<" "<<x<<" q "<<endl;
		}
		if(ans[g[1]][g[2]]<=g[3]) r+='1';
		else r+='0'; 
	}
	cout<<r<<"\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}