#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=1e17;
int n,m,k,vis[500005];

struct dd{
    int to,f;
    ll dis;
};
struct rd{
    int f;
    ll dis;
}a[500005];
struct node{
    int id,f;
    ll dis;
    bool operator<(const node y)const{
        if(f!=y.f)return f>y.f;
        return dis>y.dis;
    }
}dist[500005];
vector<dd>e[500005];
vector<int>ind[500005];
void __(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        e[i].clear();
        ind[i].clear();
        dist[i]={0,m+1,inf};
        vis[i]=0;
    }
    for(int i=1;i<=m;i++){
        int u,v,c;
        ll l;
        cin>>u>>v>>c>>l;
        e[u].push_back({v,c,l});
        e[v].push_back({u,c,l});
    }
    for(int i=1;i<=k;i++){
        cin>>a[i].f>>a[i].dis;
        ind[a[i].f].push_back(i);
    }
    priority_queue<node>q;
    dist[1]={1,0,0};
    q.push(dist[1]);
    while(!q.empty()){
        int u=q.top().id,f=q.top().f,dis=q.top().dis;
        q.pop();
        if(vis[u])continue;
        vis[u]=1;
        // cout<<"U"<<u<<"\n";
        for(auto [v,ff,len]:e[u]){
            if(ff==a[f].f){
                // cout<<"A\n";
                if(dis+len>a[f].dis)continue;
                node tmp=node{v,f,len+dis};
                if(dist[v]<tmp){
                    dist[v]=tmp;
                    q.push(dist[v]);
                }
                continue;
            }
            // cout<<"B "<<v<<" "<<ff<<" "<<len<<"\n";
            auto it=lower_bound(ind[ff].begin(),ind[ff].end(),f);
            if(it==ind[ff].end())continue;
            int nex=(*it);
            node tmp=node{v,nex,len};
            // cout<<"C"<<v<<" "<<nex<<" "<<len<<"\n";
            if(dist[v]<tmp){
                dist[v]=tmp;
                q.push(dist[v]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        cout<<vis[i];
    }
    cout<<"\n";
}
int main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int _;cin>>_;while(_--)__();
}