#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
const int N = 5e5 + 10;
const int INF = 1e9 + 7;
priority_queue<pii, vector<pii>, greater<pii>> hx[N], q;
map<int, vector<pii>> G[N];
int vis[N], dis[N];
void add(int x){
	for(auto &[col, vec]: G[x]){
		for(auto [to, len]: vec){
			hx[col].push({len, x});
		}
	}
}
void extend(int x, int col, int mx){
	while(!G[x][col].empty()){
		auto [y, len] = G[x][col].back();
		if(dis[x] + len > mx) break;
		G[x][col].pop_back();
		if(!vis[y] && dis[y] > dis[x] + len){
			dis[y] = dis[x] + len;
			q.push({dis[y], y});
		}
	}
}
void solve(){
	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++ i){
		G[i].clear(); vis[i] = 0; dis[i] = INF;
	}
	for(int i = 1; i <= n; ++ i){
		while(!hx[i].empty()) hx[i].pop();
	}
	for(int i = 1; i <= m; ++ i){
		int u, v, c, l;
		cin >> u >> v >> c >> l;
		G[u][c].push_back({v, l});
		G[v][c].push_back({u, l});
	}
	for(int i = 1; i <= n; ++ i){
		for(auto &[x, vec]: G[i])
			sort(vec.begin(), vec.end(), [&](pii a, pii b){
				return a.second > b.second;
			});
	}
	vis[1] = 1;
	add(1);
	for(int Times = 1; Times <= k; ++ Times){
		vector<int> sta;
		int col, len; cin >> col >> len;
		while(!hx[col].empty() && hx[col].top().first <= len){
			auto[bian, to] = hx[col].top();
			hx[col].pop();
			dis[to] = 0;
			extend(to, col, len);
		}
		while(!q.empty()){
			auto [bian, now] = q.top(); q.pop();
		    if(dis[now]^bian) continue;
			vis[now] = 1; 
			add(now);
			sta.push_back(now);
			extend(now, col, len);
		}
		for(int x: sta) dis[x] = INF;
	}
	for(int i = 1; i <= n; ++ i) cout << vis[i];
	cout << endl;
}
signed main(){
	ios::sync_with_stdio(0);
	int T;
	cin >> T;
	while(T--) solve();
}