#include<bits/stdc++.h>
#define int long long
#define P pair<int,int>
using namespace std;
const int N=5e5+10,INF=1e10;
int n,m,k;
bool vis[N];
struct node{
	int to,c,l;
};
vector<node> p[N];
int st,dis[N];
struct cmp{
	bool operator()(const P &a,const P &b){
		return a.second>b.second;
	}
};
void djs(int bl,int len){
	priority_queue<P,vector<P>,cmp> q;
	queue<int> in;
	dis[st]=0;vis[st]=0;
	q.push({st,0});
	while(q.size()){
		int x=q.top().first;q.pop();
		//cout<<x<<" "<<vis[x]<<endl;
		in.push(x);
		if(vis[x]) continue;
		vis[x]=1;
		for(int i=0;i<p[x].size();i++){
			int y=p[x][i].to,c=p[x][i].c,l=p[x][i].l;
			//cout<<y<<" "<<c<<" "<<l<<" "<<dis[x]<<" "<<dis[y]<<endl;
			//cout<<len<<" "<<bl<<endl;
			if(dis[y]<=dis[x]+l||dis[x]+l>len||c!=bl||vis[y]) continue;
			else{
				dis[y]=dis[x]+l;
				q.push({y,dis[y]});
			}
		}
	}
	int x=in.front();in.pop();
	while(in.size()){
		int y=in.front();in.pop();
		if(p[x].size()<p[y].size()) swap(x,y);
		for(int i=0;i<p[y].size();i++){
			int to=p[y][i].to,c=p[y][i].c,l=p[y][i].l;
			p[x].push_back({to,c,l});
			//cout<<y<<" "<<to<<" "<<c<<" "<<l<<endl;
		}
		p[y].clear();
	}
	st=x;
	//cout<<"now is "<<" "<<st<<endl;
}
void solve(){
	memset(dis,0x3f,sizeof dis);
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		int x,y,c,l;
		cin>>x>>y>>c>>l;
		p[x].push_back({y,c,l});
		p[y].push_back({x,c,l});
	}
	st=1;
	while(k--){
		int a,b;
		cin>>a>>b;
		djs(a,b);
	}
	vis[st]=1;
	for(int i=1;i<=n;i++) cout<<vis[i];
	cout<<endl;
	for(int i=1;i<=n;i++) p[i].clear(),vis[i]=0;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--) solve();
}