#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

#define N 2005

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

char s[N<<3];
int buc[N],a[N][N];
array<int,3> E[N<<4];

struct UN{
    int f[N];
    void init(int n){for(int i=1;i<=n;i++)f[i]=i;}
    int find(int x){return (f[x]==x?x:f[x]=find(f[x]));}
    bool merge(int x,int y){
        x=find(x);y=find(y);if(x==y)return false;
        f[x]=y;return true;
    }
}U;

int dis[N][N],vis[N];
vi Q[N];
vector<pi> e[N];

void solve(){
    int n=read(),l=read(),q=read(),cnt=0;U.init(n);
    for(int i=1;i<=l;i++){
        scanf("%s",s+1);
        memset(buc,0,sizeof(buc));
        int col=0;
        for(int j=1;j<=n;j++){
            int num=(s[(j-1)*2+1]-48)*50+(s[(j-1)*2+2]-48);
            buc[num]++;
            a[i][j]=num;
            if(buc[num]==1)col++;
        }
        if(col<n-1)continue;
        if(col==n-1){
            int pos=0,goal=0;
            for(int j=1;j<=n;j++){
                if(buc[j]==2)pos=j;
                if(buc[j]==0)goal=j;
            }
            for(int j=1;j<=n;j++){
                if(a[i][j]==pos)E[++cnt]={j,goal,i};
            }
            continue;
        }
        for(int j=1;j<=n;j++){
            if(U.merge(j,a[i][j])){
                E[++cnt]={j,a[i][j],i};
                E[++cnt]={a[i][j],j,i};
            }
        }
    }

    for(int i=1;i<=cnt;i++){
        auto [u,v,w]=E[i];
        e[u].pb(mp(v,w));
    }

    for(int i=1;i<=n;i++){
        memset(dis[i],0x3f,sizeof(dis[i]));
        memset(vis,0,sizeof(vis));
        dis[i][i]=0;Q[0].pb(i);int pos=0;
        while(1){
            while(pos<=n && Q[pos].size()==0)pos++;
            if(pos>n)break;
            int u=Q[pos].back();Q[pos].pop_back();
            if(vis[u])continue;vis[u]++;
            for(auto [v,w]:e[u]){
                if(dis[i][v]>max(dis[i][u],w)){
                    dis[i][v]=max(dis[i][u],w);
                    Q[dis[i][v]].pb(v);
                }
            }
        }
    }

    for(int i=1;i<=q;i++){
        scanf("%s",s+1);
        int A=(s[1]-48)*50+(s[2]-48),B=(s[3]-48)*50+(s[4]-48),C=(s[5]-48)*50+(s[6]-48);
        if(dis[A][B]>C)putchar('0');
        else putchar('1');
    }

    for(int i=1;i<=n;i++)e[i].clear();
    putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    int T=read();while(T--)solve();
}