#include <bits/stdc++.h>
using namespace std;

struct Bits {
	vector<unsigned long long> b;
	vector<int> sum;
	int len;

	Bits(int n) {
		len = n >> 6;
		b.resize(len + 1, 0);
		sum.resize(len + 1, 0);
	}

	// 第 k 位（从 1 开始编号）设为 1
	void set(int k) {
		k--;  // 内部从 0 开始存储
		b[k >> 6] |= (1ull << (k & 0x3f));
	}

	// 设定完毕后调用
	void prepare() {
		for (int i = 0; i < b.size(); i++) {
			if (i) sum[i] = sum[i - 1];
			sum[i] += __builtin_popcountll(b[i]);
		}
	}

	int rank1(int k) {
		int res = 0;
		int hi = (k >> 6), lo = (k & 0x3f);
		if (hi) res += sum[hi - 1];
		// (1 << lo) - 1 取了小于 lo 的位，正好符合从 0 开始存储
		res += __builtin_popcountll(b[hi] & ((1ull << lo) - 1ull));
		return res;
	}

	int rank0(int k) { return k - rank1(k); }
};

struct WaveletMatrix {
	vector<Bits> b;
	int n;

	// 注意 a 将被修改
	WaveletMatrix(int n, int *a) {
		this->n = n;
		b.resize(32, Bits(n));
		for (int j = 31; j >= 0; j--) {
			for (int i = 1; i <= n; i++)
				if ((a[i] >> j) & 1) b[j].set(i);
			b[j].prepare();
			stable_partition(a + 1, a + n + 1, [&](int x) { return (x >> j) & 1; });
		}
	}

	int id(int j, int c, int i) {
		return c ? b[j].rank1(i) : b[j].rank0(i) + b[j].rank1(n);
	}

	int kth(int l, int r, int k) {
		int res = 0;
		for (int j = 31; j >= 0; j--) {
			int cnt = b[j].rank0(r) - b[j].rank0(l - 1);
			if (cnt >= k) {
				l = id(j, 0, l - 1) + 1;
				r = id(j, 0, r);
			} else {
				res |= (1 << j);
				k -= cnt;
				l = id(j, 1, l - 1) + 1;
				r = id(j, 1, r);
			}
		}
		return res;
	}

	int ranking(int l, int r, int w) {
		int res = 0;
		for (int j = 31; j >= 0; j--) {
			int c = (w >> j) & 1;
			if (c) {
				res += b[j].rank0(r) - b[j].rank0(l - 1);
				l = id(j, 1, l - 1) + 1;
				r = id(j, 1, r);
			} else {
				l = id(j, 0, l - 1) + 1;
				r = id(j, 0, r);
			}
		}
		return res;
	}
};


const int MAXN(5e5 + 5);

struct Edge {
	int v, w, c;
	Edge(int v, int w, int c) : v(v), w(w), c(c) {}
};

struct Node {
	int u, w, c, k;
	Node(int u, int w, int c, int k) : u(u), w(w), c(c), k(k) {}
};

int n, m, k;
int b[MAXN], tmp[MAXN];
bool vis[MAXN];
vector<int> ts[MAXN];
vector<Edge> graph[MAXN];
vector<WaveletMatrix> wms;

Node calc(Node u, Edge e) {
	if (u.c == e.c && b[u.k] >= e.w + u.w) {
		return Node(e.v, e.w + u.w, e.c, u.k);
	}
	int l = 0, r = ts[e.c].size() - 1, mid;
	if (b[ts[e.c][l]] >= e.w) {
		while (l < r) {
			mid = (l + r + 1) >> 1;
			if (b[ts[e.c][mid]] >= e.w) l = mid;
			else r = mid - 1;
		}
		l++;
		int rk = wms[e.c].ranking(1, l, u.k + 1) + 1;
		if (rk <= l) {
			int k = wms[e.c].kth(1, l, rk);
			return Node(e.v, e.w, e.c, k);
		}
	}
	return Node(-1, -1, -1, -1);
}

bool operator < (Node a, Node b) {
	return a.k != b.k ? a.k > b.k : a.w > b.w;
}

void solve() {
	scanf("%d %d %d", &n, &m, &k);
	for (int i = 1; i <= n; i++) {
		graph[i].clear();
		vis[i] = false;
	}
	for (int i = 1; i <= m; i++) {
		ts[i].clear();
		int u, v, w, c;
		scanf("%d %d %d %d", &u, &v, &c, &w);
		graph[u].emplace_back(v, w, c);
		graph[v].emplace_back(u, w, c);
	}
	for (int i = 1; i <= k; i++) {
		int c;
		scanf("%d %d", &c, b + i);
		ts[c].emplace_back(i);
	}
	wms.clear();
	wms.emplace_back(0, tmp);
	for (int i = 1; i <= m; i++) {
		sort(ts[i].begin(), ts[i].end(), [&](int x, int y) { return b[x] > b[y]; });
		int tt = ts[i].size();
		for (int j = 1; j <= tt; j++) {
			tmp[j] = ts[i][j - 1];
		}
		wms.emplace_back(tt, tmp);
	}
	priority_queue<Node> pq;
	pq.emplace(1, 0, 0, 0);
	while (!pq.empty()) {
		Node u = pq.top();
		pq.pop();
		if (vis[u.u]) continue;
		vis[u.u] = true;
		for (Edge e : graph[u.u]) {
			if (vis[e.v]) continue;
			Node v = calc(u, e);
			if (v.u == -1) continue;
			pq.emplace(v);
		}
	}
	for (int i = 1; i <= n; i++) {
		putchar(vis[i] ? '1' : '0');
	}
	puts("");
}

int main() {
	int _;
	scanf("%d", &_);
	while (_--) {
		solve();
	}
	return 0;
}