#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

struct edge
{
    int nei;
    int c;
    i64 l;

    edge() = default;
    edge(int nei, int c, i64 l) : nei(nei), c(c), l(l)
    {
    }
};

struct segment_tree
{
    struct node
    {
        int l, r;
        i64 val;
    };

    vector<node> a;
    vector<i64> *b{};
    vector<int> *idx{};

    void build(int l, int r, int k = 1)
    {
        a[k].l = l;
        a[k].r = r;
        if (l == r)
        {
            a[k].val = (*idx)[l];
            return;
        }
        int mid = (l + r) >> 1;
        build(l, mid, k << 1);
        build(mid + 1, r, k << 1 | 1);
        update(a[k], a[k << 1], a[k << 1 | 1]);
    }

    void update(node &dest, const node &src1, const node &src2) const
    {
        if ((*b)[src1.val] > (*b)[src2.val])
            dest.val = src1.val;
        else
            dest.val = src2.val;
    }

    node query(int l, int r, int k = 1)
    {
        if (l == a[k].l && r == a[k].r)
            return a[k];
        int mid = (a[k].l + a[k].r) >> 1;
        if (r <= mid)
            return query(l, r, k << 1);
        else if (l >= mid + 1)
            return query(l, r, k << 1 | 1);
        node ans{};
        ans.l = l;
        ans.r = r;
        update(ans, query(l, mid, k << 1), query(mid + 1, r, k << 1 | 1));
        return ans;
    }
};

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<edge>> g(n + 1);
    for (int i = 1; i <= m; i++)
    {
        int u, v, c;
        i64 l;
        cin >> u >> v >> c >> l;
        g[u].push_back({v, c, l});
        g[v].push_back({u, c, l});
    }

    vector<int> a(k + 1);
    vector<i64> b(k + 1);
    for (int i = 1; i <= k; i++)
        cin >> a[i] >> b[i];

    vector<vector<int>> cidx(m + 1, vector<int>(1));
    for (int i = 1; i <= k; i++)
        cidx[a[i]].push_back(i);

    vector<segment_tree> segs(m + 1);
    for (int i = 1; i <= m; i++)
    {
        int cnt = int(cidx[i].size()) - 1;
        segs[i].a.resize((cnt + 1) << 2);
        segs[i].b = &b;
        segs[i].idx = &(cidx[i]);
        if (cnt == 0)
            continue;
        segs[i].build(1, cnt);
    }

    vector<int> vis(n + 1);
    vector<pair<int, i64>> dist(n + 1, {k + 1, 0});

    priority_queue<pair<pair<int, i64>, int>, vector<pair<pair<int, i64>, int>>, greater<>> pq;
    pq.push({{0, 0}, 1});
    dist[1] = {0, 0};
    while (!pq.empty())
    {
        auto [d, node] = pq.top();
        pq.pop();
        if (vis[node])
            continue;
        vis[node] = 1;
        for (const edge &e : g[node])
        {
            auto [nei, c, l] = e;
            if (vis[nei])
                continue;
            if (c == a[d.first] && l + d.second <= b[d.first])
            {
                if (make_pair(d.first, l + d.second) < dist[nei])
                {
                    dist[nei] = {d.first, l + d.second};
                    pq.push({dist[nei], nei});
                }
            }
            else
            {
                if (cidx[c].size() == 1)
                    continue;
                segment_tree &seg = segs[c];
                int ll = upper_bound(cidx[c].begin() + 1, cidx[c].end(), d.first) - cidx[c].begin();
                int L = ll;
                if (ll == (int)cidx[c].size())
                    continue;
                int rr = (int)cidx[c].size() - 1;
                if (b[seg.query(L, rr).val] < l)
                    continue;
                while (ll < rr)
                {
                    int mid = (ll + rr) >> 1;
                    if (b[seg.query(L, mid).val] >= l)
                        rr = mid;
                    else
                        ll = mid + 1;
                }

                int idx = cidx[c][ll];
                if (make_pair(idx, l) < dist[nei])
                {
                    dist[nei] = {idx, l};
                    pq.push({dist[nei], nei});
                }
            }
        }
    }

    for (int i = 1; i <= n; i++)
    {
        if (dist[i] != pair<int, i64>{k + 1, 0})
            cout << 1;
        else
            cout << 0;
    }
    cout << "\n";
}

int main()
{
#ifdef lijn
    freopen("/home/lijn/acm_practice/.build/input.in", "r", stdin);
    freopen("/home/lijn/acm_practice/.build/output.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}