#include<bits/stdc++.h>
using namespace std;
int t,n,m,k,u,v,w,c;
vector<tuple<int,int,int> >V[500000+10];
pair<int,int>tck[500000+10],dis[50000+10];
bool vis[500000+10];
int main(){
	cin>>t;
	while(t--){
		memset(tck,0,sizeof(tck));
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=500000;i++)V[i].clear();
		cin>>n>>m>>k;
		for(int i=1;i<=m;i++){
			cin>>u>>v>>c>>w;
			V[u].emplace_back(v,c,w);
			V[v].emplace_back(u,c,w);
		}
		for(int i=1;i<=k;i++){
			cin>>c>>w;
			tck[i]={c,w};
		}
		memset(dis,0x3f,sizeof(dis));
		dis[1]={0,0};
		vis[1]=1;
		priority_queue<tuple<int,int,int>,vector<tuple<int,int,int> >,greater<tuple<int,int,int> > >Q;
		Q.emplace(0,0,1);
		while(!Q.empty()){
			int p=get<0>(Q.top()),usd=get<1>(Q.top()),u=get<2>(Q.top());Q.pop();
//			cout<<"now point"<<p<<" "<<usd<<" "<<u<<endl;
			for(auto vv:V[u]){
				int v=get<0>(vv),c=get<1>(vv),l=get<2>(vv);
 
				if(c==tck[p].first&&usd+l<=tck[p].second){
					if(make_pair(c,usd+l)<=dis[v]){
						dis[v]={p,usd+l};
						Q.emplace(p,usd+l,v);
						vis[v]=1;
					}
				}else{
					int o=0;
					for(int i=max(p+1,1);i<=k;i++)if(tck[i].first==c&&tck[i].second>=l){o=i;break;}
					if(o==0)continue;
					if(make_pair(o,l)<=dis[v]){
						dis[v]={o,l};
						Q.emplace(o,l,v);
						vis[v]=1;
					}
				}
			}
		}
		for(int i=1;i<=n;i++)cout<<(vis[i]?1:0);
		cout<<endl;
	}
}