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

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    using E = array<int, 3>;
    using P = pair<int64_t, int64_t>;
    vector<E> g[n + 1];

    for (int i = 0; i < m; i++)
    {
        int u, v, c, l;
        cin >> u >> v >> c >> l;
        g[u].push_back({v, c, l});
        g[v].push_back({u, c, l});
    }
    vector<int> vis(n + 1);
    vector<priority_queue<P,vector<P>,greater<P>>> q(m + 1);
    vis[1] = 1;
    for (auto [v, c, l] : g[1])
        q[c].push(P(l, v));
    for (int it = 0; it < k; it++)
    {
        int C, L;
        cin >> C >> L;
        vector<P> tmp;
        while (!q[C].empty())
        {
            auto [l, u] = q[C].top();
            if (l > L)
                break;
            q[C].pop();
            if (vis[u])
                continue;
            vis[u] = 1;
            for (auto [v, c, w] : g[u])
            {
                if (vis[v])
                    continue;
                if (c == C)
                {
                    //tmp.push_back(P(-w, v));
                    q[c].push(P((l + w), v));
                }
                else
                {
                    q[c].push(P(w, v));
                }
            }
        }
        for(auto [l,u] : tmp)
        {
            if (vis[u])
                continue;
            q[C].push(P(l,u));
        }
    }
    for(int i = 1;i <= n;i++)
        cout << vis[i];
    cout << '\n';
}

int main()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
    auto _ = clock();
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--)
        solve();
#ifdef LOCAL
    cerr << clock() - _ << '\n';
#endif
    return 0;
}