#include <bits/stdc++.h>
#define fo(i,x,y) for(register int i=(x);i<=(y);i++)
#define de(i,x,y) for(register int i=(x);i>=(y);i--)
#define file(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const ll N=5e5+50,M=5e6+50,L=0;
const ll P=0,inf=1e9;
inline ll read(){
	ll x=0;bool f=0;char c=getchar();
	while(c<'0'||c>'9') f|=(c=='-'),c=getchar();
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
struct Edge{int v,c,d;};
struct node{int id;pii d;};
bool operator >(node a,node b){return a.d>b.d;}
int n,m,k,cntt;
int a[N],b[N],rt[N],suf[N],ls[M],rs[M],len[M],val[M],pri[M],mn[M],vis[N];
pii dis[N];
vector<Edge> G[N];
map<pii,int> pre;
int newn(int l,int v){
	ls[cntt]=rs[cntt]=0;
	len[++cntt]=l,val[cntt]=mn[cntt]=v;
	pri[cntt]=rand()*rand();
	return cntt;
}
void pushup(int id){mn[id]=min({mn[ls[id]],mn[rs[id]],val[id]});}
void split(int id,int w,int &l,int &r){
	if(!id) return (void)(l=r=0);
	if(len[id]<=w) l=id,split(rs[id],w,rs[l],r);
	else r=id,split(ls[id],w,l,ls[r]);
	pushup(id);
}
int merge(int l,int r){
	if(!l||!r) return l+r;
	if(pri[l]<pri[r]){
		rs[l]=merge(rs[l],r);
		return pushup(l),l;
	}else{
		ls[r]=merge(l,ls[r]);
		return pushup(r),r;
	}
}
int find(int c,int d){
	int t1,t2;
	split(rt[c],d-1,t1,t2);
	int res=mn[t2]<inf?mn[t2]:-1;
	return (void)(rt[c]=merge(t1,t2)),res;
}
priority_queue<node,vector<node>,greater<node>> q;
void dij(){
	fo(i,1,n) vis[i]=0,dis[i]={inf,inf};
	q.push({1,dis[1]={1,0}});
	int lst=1;
	while(!q.empty()){
		int u=q.top().id;q.pop();
		pii d=dis[u];
		if(vis[u]++) continue;
		while(lst<=d.fi){
			int t1,t2,t3;
			split(rt[a[lst]],b[lst]-1,t1,t2);
			split(t2,b[lst],t2,t3);
			if(suf[lst]) val[t2]=mn[t2]=suf[lst];
			rt[a[lst]]=suf[lst]?merge(t1,t2):t1;
			rt[a[lst]]=merge(rt[a[lst]],t3);
			lst++;
		}
		for(Edge e:G[u]){
			pii vd={inf,inf};
			if(e.c==a[d.fi]&&b[d.fi]-d.se>=e.d) vd={d.fi,d.se+e.d};
			else{
				int nxt=find(e.c,e.d);
//				if(u==2&&e.v==4) cout<<lst<<" "<<e.c<<" "<<e.d<<endl;
				if(nxt!=-1) vd={nxt,e.d};
			}
			if(vd<dis[e.v]) dis[e.v]=vd,q.push({e.v,vd});
		}
	}		
}
signed main(){
	int T=read();
	while(T--){
		fo(i,1,m) suf[i]=rt[i]=0;
		fo(i,1,n) G[i].clear();
		pre.clear(); 
		mn[0]=val[0]=inf;
		n=read(),m=read(),k=read();
		fo(i,1,m){
			int u=read(),v=read(),c=read(),l=read();
			G[u].push_back({v,c,l});
			G[v].push_back({u,c,l});
		}
		fo(i,1,k){
			a[i]=read(),b[i]=read();
			if(pre[{a[i],b[i]}]) suf[pre[{a[i],b[i]}]]=i;
			else{
				int t1,t2;
				split(rt[a[i]],b[i],t1,t2);
				rt[a[i]]=merge(merge(t1,newn(b[i],i)),t2);
			}
			pre[{a[i],b[i]}]=i;
		}
		dij();
		fo(i,1,n) printf("%d",!!vis[i]);
		printf("\n");
	}
	return 0;
}