#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rept(i, a, ne) for(int i = (a); ~i ; i=ne[i])
#define debug(x) cout<<#x<<": "<<x<<endl
#define fi first
#define sec second
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double  LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef pair<int,int>PII;
const int N=2e3+10,M=4*N;
int h[N],ne[M],e[M],w[M],idx;
int get(string &s,int x)
{
    x--;
    return ((int)s[x*2]-48)*50+((int)s[x*2+1]-48);
}
void add(int x,int y,int z)
{
    w[idx]=z,e[idx]=y,ne[idx]=h[x],h[x]=idx++;
}
int fa[N];
int find(int x)
{
    return fa[x]==x?x:fa[x]=find(fa[x]);
}
void uni(int x,int y)
{
    fa[find(y)]=find(x);
}
int bo[N];
int n,m;
int d[N][N];
bool st[N];
void dij(int o)
{
  
    rep(i,1,n)
    st[i]=0;
    d[o][o] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> q;
    q.push({0, o});

    while (q.size())
    {
        auto [z,x] = q.top();
        q.pop();
    
        if (st[x]) continue;
        st[x] = 1;
    
        for (int i = h[x]; i != -1; i = ne[i])
        {
            int y = e[i];
  
            if (d[o][y] > max(z , w[i]))
            {
                d[o][y] = max(z , w[i]);
                q.push({d[o][y], y});
            }
        }
    }

}

void slove()
{

    int q;
    cin>>n>>m>>q;
    idx=0;
    rep(i,1,n)
    {
        fa[i]=i;
        h[i]=-1;
        rep(j,1,n)
        d[i][j]=INT_MAX;
    }
    vector<array<int,3>>ve;
    rep(i,1,m)
    {
        int p=0,o;
        string s;
        cin>>s;
        rep(j,1,n)
        bo[j]=0;
        rep(j,1,n)
        {
            int x=get(s,j);
    
            if(bo[x])
            {
                if(p==0)
                p=j,o=bo[x];
                else
                p=-1;
            }
            bo[x]=j;
        }
        if(p==0)
        {
            rep(j,1,n)
            {
                if(find(j)!=find(bo[j]))
                {
                    ve.push_back({bo[j],j,i});
                    ve.push_back({j,bo[j],i});
                    uni(j,bo[j]); 
                }
            }
        }
        else if(p!=-1)
        {
            rep(j,1,n)
            {
                if(bo[j]==0)
                {
                    ve.push_back({p,j,i});
                    ve.push_back({o,j,i}); 
                }
            }
        }   
    }

    for(auto [x,y,z]:ve)
    {
        add(x,y,z);
    }
    
    rep(i,1,n)
        dij(i); 
    string res;
    rep(i,1,q)
    {
        string s;
        cin>>s;
        int a=get(s,1),b=get(s,2),c=get(s,3);
        res+=(char)((d[a][b]<=c)+'0');
    }
    cout<<res<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//	cout << fixed << setprecision(9);
    int t=1;
	cin>>t;
    while(t--)
    {
        slove();
    }


    return 0;
}
//#pragma GCC optimize(2)