#include<bits/stdc++.h>
using namespace std;
#define tp tuple<int,int,int>
bool cmp(const pair<int,int>& a,const pair<int,int>& b)
{
    if(a.first!=b.first){return a.first>b.first;}
    else{return a.second>b.second;}
}

bool cmp1(const pair<int,int>& a,const pair<int,int>& b)
{
    if(a.first!=b.first){return a.first<b.first;}
    else{return a.second<b.second;}
}

void solve()
{
    int n,m,k;
    int i,j,u,v,c,l,r;
    scanf("%d %d %d",&n,&m,&k);
    vector<tp> s[n+10];
    for(i=1;i<=m;i++)
    {
        scanf("%d %d %d %d",&u,&v,&c,&l);
        s[u].push_back({v,c,l});
        s[v].push_back({u,c,l});
    }
    vector<pair<int,int>> t(k+10);
    vector<pair<int,int>> st[m+10];
    vector<int> vis(n+10);
    for(i=1;i<=k;i++)
    {
        scanf("%d %d",&u,&v);
        t[i]={u,v};
        st[u].push_back({v,i});
    }
    for(i=1;i<=m;i++)
    {
        sort(st[i].begin(),st[i].end(),cmp);
    }

    priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>> pq;
    pq.push({1,0,1});
    while(!pq.empty())
    {
        tp o=pq.top();pq.pop();
        int x=get<0>(o),y=get<1>(o),z=get<2>(o);
        if(vis[z]){continue;}
        vis[z]=1;
        for(i=0;i<s[z].size();i++)
        {
            if(vis[get<0>(s[z][i])]){continue;}
            int xx=get<0>(s[z][i]),yy=get<1>(s[z][i]),zz=get<2>(s[z][i]);
            if(t[x].first==yy&&y+zz<=t[x].second)
            {
                pq.push({x,y+zz,xx});
                continue;
            }
            else
            {
                pair<int,int> target={zz,x+1};
                auto pp=upper_bound(st[yy].begin(),st[yy].end(),target,cmp1);
                while(pp!=st[yy].end()&&pp->second<x+1){pp++;}
                if(pp!=st[yy].end()&&pp->first>=zz&&pp->second>=x+1)
                {
                    pq.push({pp->second,zz,xx});
                }
                // 暴力
                // for(j=0;j<st[yy].size();j++)
                // {
                //     if(st[yy][j].first>=zz&&st[yy][j].second>=x+1)
                //     {
                //         pq.push({st[yy][j].second,zz,xx});
                //         break;
                //     }
                // }
            }
        }
    }
    for(i=1;i<=n;i++){printf("%d",vis[i]);}
    printf("\n");
}

int main()
{
    int tt;
    scanf("%d",&tt);
    while(tt--){solve();}
}