#include<bits/stdc++.h>
#define LL long long
#define O4 __inline__ __attribute__((always_inline))
#define inf 0x7fffffff
#define UL unsigned LL
#define LD long double
#ifdef ONLINE_JUDGE
#define getchar nc
#endif
//#define int LL
namespace FastIO{
	O4 char nc(){
		static char buf[100000],*p1=buf,*p2=buf;
		return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
	}
	O4 int read(){
		char t;int u=0,k=1;t=getchar();
		while(t<'0'||t>'9'){if(t==EOF)return -233;if(t=='-')k=-1;t=getchar();}
		while(t>='0'&&t<='9'){u=u*10+t-'0';t=getchar();}
		return u*k;
	}
	template <typename T>
	O4 void read(T &u){
		char t;T k=1;u=0;t=getchar();
		while(t<'0'||t>'9'){if(t=='-')k=-1;t=getchar();}
		while(t>='0'&&t<='9'){u=u*10+t-'0';t=getchar();}
		if(t=='.'){
			T mass=0.1;t=getchar();
			while(t>='0'&&t<='9'){u+=mass*(t-'0');mass/=10;t=getchar();}
		}u*=k;
	}
	O4 int read(char asd[]){
		char t=getchar();int u=0;
		while(t==' '||t=='\n'||t=='\r')t=getchar();
		if(t==EOF)return -1;
		while(t!=' '&&t!='\n'&&t!=EOF&&t!='\r')asd[u++]=t,t=getchar();
		asd[u]='\0';return u;
	}
	char sr[1<<23],z[23];int C=-1,Z;
	O4 void wer(int x,char T){
		int y=0;if(x<0)y=1,x=-x;
		while(z[++Z]=x%10+'0',x/=10);if(y)z[++Z]='-';
		while(sr[++C]=z[Z],--Z);sr[++C]=T;
	}
	O4 void wer(char T[],char QWQ){
		for(int i=0;T[i]!='\0';i++)sr[++C]=T[i];
		sr[++C]=QWQ;
	}
	O4 void out(){fwrite(sr,1,C+1,stdout);C=-1;}
}
using namespace std;
using namespace FastIO;
const int N=5e5+5;
int n,m,a,b,c,d,e,limit,k;
struct sss{
	int x,t,v;
	friend bool operator < (const sss &a,const sss &b){
		return a.t>b.t||a.t==b.t&&a.v>b.v;
	}
}dist[N];
priority_queue <sss> hp,Z1;
struct ttt{
	int x,len;
	friend bool operator < (const ttt &a,const ttt &b){
		return a.len>b.len;
	}
};
priority_queue <ttt> load[N],Z2;
bool vis[N];
struct ooo{
	int to,com,len;
};
vector <ooo> MP[N],Z3;
void solve(){
	n=read();m=read();k=read();
	for(int i=2;i<=n;i++)dist[i].t=k+233;
	for(int i=1;i<=n;i++)MP[i]=Z3,vis[i]=0;
	hp=Z1;
	for(int i=1;i<=m;i++)load[i]=Z2;
	while(m--){
		a=read();b=read();c=read();d=read();
		MP[a].push_back((ooo){b,c,d});
		MP[b].push_back((ooo){a,c,d});
	}
	hp.push((sss){1,0,0});
	for(int GG=1;GG<=k;GG++){
		int c=read(),OVO=read();
		while(!load[c].empty()){
			if(load[c].top().len>OVO)break;
			sss op;
			op.x=load[c].top().x;
			op.t=GG;
			op.v=load[c].top().len;
			if(dist[op.x]<op){
				hp.push(op);
				dist[op.x]=op;
			}
			load[c].pop();
		}
		while(!hp.empty()){
			int x=hp.top().x,t=hp.top().t,v=hp.top().v;
			if(t>GG)break;
			hp.pop();
			if(vis[x])continue;
			vis[x]=1;
			if(t!=GG)v=0;
			for(ooo i:MP[x]){
				if(i.com!=GG||v+i.len>OVO){
					load[i.com].push((ttt){i.to,i.len});
				}
				else{
					sss op;
					op.x=i.to;
					op.t=GG;
					op.v=v+i.len;
					if(dist[op.x]<op){
						hp.push(op);
						dist[op.x]=op;
					}
				}
			}
		}
//		cout<<GG<<"===================\n";
//		for(int i=1;i<=n;i++)cout<<vis[i];cout<<'\n';
	}
	for(int i=1;i<=n;i++)cout<<vis[i];cout<<'\n';
}
signed main(){
	int T=1;
	T=read();
	while(T--)solve();
}
/*
2

3 1 1
2 3 1 10
1 100

5 6 4
1 2 1 30
2 3 1 50
2 5 5 50
3 4 6 10
2 4 5 30
2 5 1 40
1 70
6 100
5 40
1 30

*/