#include <bits/stdc++.h>
#define mkp make_pair
#define fi first
#define se second
#define debug(x) cerr<<"line: "<<__LINE__<<" with "<<x<<"\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using vi = vector<int>;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;
template<class T>bool chkMin(T &x,T y){if(x>y)return x=y,true;return false;}
template<class T>bool chkMax(T &x,T y){if(x<y)return x=y,true;return false;}
template<class T>void moder(T &x){x%=mod;}
const int MAXN = 500005;
int n,m,k;
struct edge{int v,c,w;};
vector<edge> vec[MAXN];
int logn[MAXN];
struct RMQ{
	vector<array<int,20>> st;
	vector<int> pos;
	void add(int p,int len){
		st.push_back({0});
		st[(int)st.size()-1][0]=len;
		pos.push_back(p);
	}
	void init(){
		int n=(int)pos.size()-1;
		for(int j=1;j<20;j++){
			for(int i=0;i+(1<<j)-1<n;i++){
				st[i][j]=max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
			}
		}
	}
	int query(int l,int r){
		int LG = logn[r-l+1];
		return max(st[l][LG],st[r-(1<<LG)+1][LG]);
	}
	int getNext(int p,int len){
		int L = upper_bound(pos.begin(),pos.end(),p)-pos.begin();
		if(L==(int)pos.size())return -1;
		int R = (int)pos.size()-1;
		int lb = L;
		if(query(L,R)<len)return -1;
		auto check = [&](int x){
			return query(lb,x)>=len;
		};
		while(L<R){
			int mid = (L+R)/2;
			if(check(mid))R=mid;
			else L=mid+1;
		}
		return pos[L];
	}
}rmq[MAXN];
struct node{int bel,len;}a[MAXN];
bool vis[MAXN];
pii dis[MAXN];
void solve(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)vec[i].clear();
	for(int i=1;i<=m;i++){
		int u,v,c,w;cin>>u>>v>>c>>w;
		vec[u].push_back({v,c,w});
		vec[v].push_back({u,c,w});
		rmq[i].st.clear();
		rmq[i].pos.clear();
	}
	for(int i=1;i<=k;i++){
		int bel,len;cin>>bel>>len;
		rmq[bel].add(i,len);
		a[i]={bel,len};
	}
	for(int i=1;i<=n;i++)dis[i]={INF,INF},vis[i]=0;
	dis[1]={1,0};
	using inq = pair<pii,int>;
	priority_queue<inq,vector<inq>,greater<inq>> q;
	q.push({dis[1],1});
	while(!q.empty()){
		int k = q.top().second;q.pop();
		if(vis[k])continue;
		vis[k]=1;
		for(auto [j,c,w] : vec[k]){
			if(a[dis[k].first].bel == c 
				&& a[dis[k].first].len>=dis[k].second+w){
				if(dis[j]>pii(dis[k].first,dis[k].second+w)){
					dis[j]=pii(dis[k].first,dis[k].second+w);
					q.push({dis[j],j});
				}
			}else{
				//find a new one 
				int nxt = rmq[c].getNext(dis[k].first,w);
				if(nxt==-1)continue;
				if(dis[j]>pii(nxt,w)){
					dis[j]=pii(nxt,w);
					q.push({dis[j],j});
				}
			}
		}
	}
	for(int i=1;i<=n;i++)cout<<vis[i];
	cout<<"\n";
}
signed main() {
	//cerr<<(&s1-&s2)/1024.0/1024<<" ";
	cin.tie(nullptr)->sync_with_stdio(false);
	for(int i=2;i<=n;i++)logn[i]=logn[i/2]+1;
	int T;cin>>T;
	while(T--)solve();
	return 0;
}