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

struct dd{
    ll to,f;
    ll dis;
};
struct rd{
    ll f;
    ll dis;
}a[500005];
struct node{
    ll 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<ll>ind[500005];
ll h[500005];
ll st[500005][22];

ll find(ll l,ll r){
    if(r<l)return 0;
    ll t=0;
    while((1<<t)<=(r-l+1)){
        t++;
    }
    t--;
    return max(st[l][t],st[r-(1<<t)+1][t]);
}
void __(){
	memset(st,0,sizeof st);
	memset(h,0,sizeof h);
	memset(a,0,sizeof a);
    cin>>n>>m>>k;
    for(ll i=1;i<=max(n,m);i++){
        e[i].clear();
        ind[i].clear();
        dist[i]={0,m+1,inf};
        vis[i]=0;
    }
    for(ll i=1;i<=m;i++){
        ll 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(ll i=1;i<=k;i++){
        cin>>a[i].f>>a[i].dis;
        ind[a[i].f].push_back(i);
    }
    for(ll i=1;i<=m;i++){
        h[i]=h[i-1]+ind[i].size();
        for(ll j=0;j<ind[i].size();j++){
            st[h[i-1]+j+1][0]=a[ind[i][j]].dis;
        }
    }
    for(ll i=1;i<=20;i++){
        for(ll j=1;j+(1<<(i))<=n+1;j++){
            st[j][i]=max(st[j][i-1],st[j+(1<<(i-1))][i-1]);
        }
    }
    
    priority_queue<node>q;
    dist[1]={1,0,0};
    q.push(dist[1]);
    while(!q.empty()){
        ll u=q.top().id,f=q.top().f;
        ll dis=q.top().dis;
        // cerr<<"u"<<u<<"\n";
        q.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(auto [v,ff,len]:e[u]){
            // cerr<<"v"<<v<<"\n";
            if(a[f].f==ff&&a[f].dis>=dis+len){
                node tmp=node{v,f,dis+len};
                if(dist[v]<tmp){
                    dist[v]=tmp;
                    q.push(dist[v]);
                }
                continue;
            }
            auto it=lower_bound(ind[ff].begin(),ind[ff].end(),f+1);
            if(it==ind[ff].end())continue;
            ll R=h[ff]+1;
            ll L=h[ff-1]+1+(it-ind[ff].begin());
            ll l=L,r=R;
            while(l<r){
                // cerr<<l<<" "<<r<<"\n";
                ll mid=l+r>>1;
                // cerr<<"LR"<<L<<" "<<mid<<" "<<find(L,mid)<<"\n";
                if(find(L,mid)>=len){
                    r=mid;
                }else{
                    l=mid+1;
                }
            }
            if(l>=R){
                continue;
            }
            // cerr<<l<<" "<<h[ff-1]<<" "<<ind[ff][l-h[ff-1]-1]<<"\n";
            assert(a[ind[ff][l-h[ff-1]-1]].f==ff);
            node tmp=node{v,ind[ff][l-h[ff-1]-1],len};
            if(dist[v]<tmp){
                dist[v]=tmp;
                q.push(dist[v]);
            }
        }
    }
    for(ll i=1;i<=n;i++){
        cout<<vis[i];
    }
    // cout<<"DID"<<dist[4].f<<" "<<dist[4].dis<<"\n";
    cout<<"\n";
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    ll _;cin>>_;
    if(_==1110){
    	__();
    	int n,m,k;
    	int a,b,c,d;
    	cin>>n>>m>>k;
    	for(int i=1;i<=m;i++){
    		cin>>a>>b>>c>>d;
    		if(40<=i&&i<=50)cout<<a<<" "<<b<<' '<<c<<' '<<d<<"|";
		}
		for(int i=1;i<=k;i++){
			cin>>a>>b;
		}
    	return 0;
	} 
	while(_--)__();
}

/*
46 64 64
21 9 5 10|8 23 3 267|40 24 2 36|18 11 1 54|28 45 5 1052|28 35 5 29|5 26 5 76|23 3 5 139|33 43 5 416|23 4 2 49|16 38 4 92|44 29 5 93|13 16 1 124|21 18 3 244|31 19 5 95|36 39 5 124|1 21 5 62|35 5 5 89|36 20 2 60|18 31 5 54|
26 41 5 67|10 3 4 63|25 41 5 5|15 12 3 274|24 20 3 157|6 30 1 34|42 25 4 58|27 17 3 37|12 6 1 79|20 37 1 245|7 12 4 41|38 13 4 34|1 16 5 10|28 8 5 32|46 44 5 91|37 30 1 29|32 42 4 17|14 22 4 93|15 2 1 57|33 7 4 12|

*/