#include<bits/stdc++.h>
using namespace std;
#define tp tuple<int,int,int>
struct ST {
    const int n, k;
    vector<vector<int>> Max;
    ST(int n) : n(n), k(__lg(n)) {
        Max.resize(k + 1, vector<int>(n + 1));
    }
    void init() {
        for (int i = 0, t = 1; i < k; i++, t <<= 1) {
            const int T = n - (t << 1) + 1;
            for (int j = 1; j <= T; j++) {
                Max[i + 1][j] = max(Max[i][j], Max[i][j + t]);
            }
        }
    }
    int getMax(int l, int r) {
        //printf("@%d %d\n",l,r);
        if (l > r) {
            swap(l, r);
        }
        int k = __lg(r - l + 1);
        //printf("*%d\n", Max[0][0]);
        return max(Max[k][l], Max[k][r - (1 << k) + 1]);
    }
};
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});
    }
    vector<ST*> St(m + 10, nullptr);
    for(i=1;i<=m;i++)
    {
        if(st[i].size())
        {
            St[i]=new ST(st[i].size());
            for(j=0;j<st[i].size();j++)
            {
                St[i]->Max[0][j+1]=st[i][j].first;
            }
            St[i]->init();
        }
    }

    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
            {
                if(st[yy][st[yy].size()-1].second<=x){continue;}
                l=0;r=st[yy].size()-1;
                
                while(l<r)
                {
                    int mid=(l+r)/2;
                    if(st[yy][mid].second<x+1){l=mid+1;}
                    else{r=mid-1;}
                }
                //printf("!%d %d\n",l,r);
                r=st[yy].size()-1;
                if(St[yy]->getMax(l+1,r+1)<zz){continue;}
                while(l!=r)
                {
                    int mid=(l+r)/2;
                    if(St[yy]->getMax(l+1,mid+1)>=zz){r=mid;}
                    else{l=mid+1;}
                }
                pq.push({st[yy][l].second,zz,xx});
            }
        }
    }
    for(i=1;i<=n;i++){printf("%d",vis[i]);}
    printf("\n");
}

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