#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;
const int maxn = 500010;
int lg[maxn];
struct Node {
    int u, r, d;
    bool operator < (const Node & a) const {
        return r == a.r ? (d > a.d) : (r > a.r);
    }
} ;
struct Sparse_table {
    int n;
    vector < vector < int > > nxt;
    vector < vector < int > > a;
    int query(int l, int r) {
        int k = lg[r - l + 1];
        return max(a[l][k], a[r - (1 << k) + 1][k]);
    }
} ;
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector < array < int, 3 > > adj[n + 5];
    rep(i, 1, m) {
        int u, v, c, l;
        cin >> u >> v >> c >> l;
        adj[u].push_back({v, c, l});
        adj[v].push_back({u, c, l});
    }
    vector < int > positions[m + 5];
    vector < int > num(k + 5), a(k + 5), b(k + 5);
    rep(i, 1, k) {
        cin >> a[i] >> b[i];
        num[i] = positions[a[i]].size();
        positions[a[i]].push_back(i);
    }
    b[k + 1] = 0;
    vector < Sparse_table > st(m + 5);
    rep(i, 1, m) {
        // for(auto [v, c, l] : adj[1]) {
        //     cerr << 1 << " " << v << " " << c << " " << l << endl;
        // }
        positions[i].push_back(k + 1);
        st[i].n = positions[i].size();
        st[i].a.assign(st[i].n + 5, vector < int > (19, 0));
        st[i].nxt.assign(st[i].n + 5, vector < int > (19, 0));
        // cerr << "i : " << i << endl;
        int cnt = 0;
        for(auto j : positions[i]) {
            st[i].a[cnt][0] = b[j];
            st[i].nxt[cnt][0] = min(cnt + 1, (int)positions[i].size() - 1);
            cnt ++;
        }
        rep(j, 1, 18) for(int u = 0; u < st[i].n; u ++) {
            st[i].nxt[u][j] = st[i].nxt[st[i].nxt[u][j - 1]][j - 1];
            st[i].a[u][j] = max(st[i].a[u][j - 1], st[i].a[st[i].nxt[u][j - 1]][j - 1]);
        }
    }
    priority_queue < Node > pq;
    vector < int > r(n + 5, 1e9);
    vector < int > d(n + 5, 1e9);
    vector < bool > vis(n + 5, 0);
    pq.push(Node{1, r[1] = 1, d[1] = 0});
    // cerr << "Here" << endl;
    // for(auto [v, c, l] : adj[1]) {
    //     cerr << 1 << " " << v << " " << c << " " << l << endl;
    // }
    while(!pq.empty()) {
        Node tmp = pq.top();
        pq.pop();
        int u = tmp.u, rr = tmp.r, dd = tmp.d;
        if(vis[u]) continue;
        vis[u] = 1;
        // cerr << "u : " << u << " r : " << rr << " d : " << dd << endl;
        for(auto [v, c, l] : adj[u]) {
            // cerr << u << " " << v << " " << c << " " << l << endl;
            int nr = -1, nd = -1;
            if(c == a[rr] && dd + l <= b[rr]) {
                nr = rr, nd = dd + l;
            } else {
                // cerr << "u : " << u << " v : " << v << " c : " << c << endl;
                int start = 0;
                // cerr << "Here" << endl;
                per(i, 18, 0) {
                    // cerr << "start : " << start << " nxt i : " << st[c].nxt[start][i] << endl;
                    if(positions[c][st[c].nxt[start][i]] <= rr) {
                        start = st[c].nxt[start][i];
                        // cerr << "start : " << start << endl;
                    }
                }
                // continue;
                if(positions[c][start] <= rr) start = st[c].nxt[start][0];
                if(positions[c][start] <= rr) continue;
                int le = start, ri = positions[c].size() - 1, pos = -1;
                while(le <= ri) {
                    int mid = (le + ri) >> 1;
                    if(positions[c][mid] > rr && st[c].query(start, mid) >= l) {
                        pos = mid;
                        ri = mid - 1;
                    } else {
                        le = mid + 1;
                    }
                }
                // satisfy > r && >= l
                // cerr << pos << endl;
                if(pos == -1) continue;
                nr = positions[c][pos];
                nd = l;
            }
            // cerr << "nr : " << nr << " nd : " << nd << endl;
            // if(nr == -1) continue;
            if(nr < r[v] || (nr == r[v] && nd < d[v])) {
                r[v] = nr;
                d[v] = nd;
                pq.push(Node{v, nr, nd});
            }
        }
    }
    string res = "";
    rep(i, 1, n) if(r[i] <= k) res += '1'; else res += '0';
    cout << res << '\n';
}
int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("J.out", "w", stdout);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(0);
    lg[1] = 0;
    rep(i, 2, 500000) lg[i] = lg[i >> 1] + 1;
    int T = 1;
    cin >> T;
    for(int t = 1; t <= T; t ++) {
        solve();
    }
    return 0;
}