#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;

#define x first
#define y second
#define rep(i, a, b) for(ll i = (a); i <= (b); i++) 
#define lep(i, a, b) for(ll i = (a); i >= (b); i--)
#define pll(x) cout << (x) << '\n';

const int N = 1e6 + 10;
ll n, m, k;
ll a[N], b[N], f[N], lg[N];
vector<pair<int, pair<int, int>>> e[N];
vector<int> clc[N], v[N];
PLL tr[N];

struct node
{
    ll ty, d, ver;
    bool operator > (const node& V) const
    {
        return d > V.d;
    }
};

void solve()
{
    cin >> n >> m >> k; lg[0] = -1;
    rep(i, 1, n) e[i].clear(), f[i] = 0; rep(i, 1, m) clc[i].clear(), v[i].clear();
    for(int i = 1, u, v, c, l; i <= m; i++) {cin >> u >> v >> c >> l; e[u].push_back({v, {c, l}}), e[v].push_back({u, {c, l}});}
    
    vector<int> ish; vector<vector<vector<int>>> sua(m + 1);
    rep(i, 1, k) 
    {
        cin >> tr[i].x >> tr[i].y; lg[i] = lg[i / 2] + 1;
        clc[tr[i].x].push_back(i), v[tr[i].x].push_back(tr[i].y); ish.push_back(tr[i].x);
    }
    sort(ish.begin(), ish.end()); ish.erase(unique(ish.begin(), ish.end()), ish.end());
    for(auto u : ish)
    {
        int sz = clc[u].size(); sua[u].resize(sz + 1); rep(i, 1, sz) sua[u][i].resize(21);
        for(int i = 0; i < sz; i++)
        {
            sua[u][i + 1][0] = v[u][i];
        }
        
        for(int i = 1; i <= lg[k]; i++) for(int j = 1; j + (1 << i) - 1 <= sz; j++)
        {
            ll v1 = sua[u][j][i - 1], to = j + (1 << (i - 1)), v2 = sua[u][to][i - 1];
            sua[u][j][i] = max(v1, v2);
        }
    }
    
    priority_queue<node, vector<node>, greater<node>> q; q.push({1, 0, 1});
    map<PLL, ll> mp;
    while(q.size())
    {
        auto [ty, d, ver] = q.top(); q.pop(); f[ver] = 1;
        //cout << ty << ' ' << d << ' ' << ver << '\n';
        
        for(auto to : e[ver])
        {
            if(to.y.x == tr[ty].x && tr[ty].y - d >= to.y.y) 
            {
                //if(mp[{ty, to.x}] == 0 || mp[{ty, to.x}] < tr[ty].y - d - to.y.y) 
                //{
                //    mp[{ty, to.x}] = tr[ty].y - d - to.y.y;
                    q.push({ty, to.y.y + d, to.x});
                    
                //}
            }
            else
            {
                int yc = to.y.x, qs;
                if(clc[yc].empty() || clc[yc].back() <= ty) continue; int sz = clc[yc].size();
                int l = -1, r = sz;
                while(l + 1 != r)
                {
                    int mid = l + r >> 1;
                    if(clc[yc][mid] > ty) r = mid; else l = mid;
                }
                int x = r;
                
                l = x, r = sz + 1;
                while(l + 1 != r)
                {
                    int mid = l + r >> 1; 
                    int len = lg[mid - x];
                    int vl = sua[yc][x + 1][len], vr = sua[yc][mid - (1 << len) + 1][len];
                    if(max(vl, vr) >= to.y.y) r = mid; else l = mid;
                }
                
                if(r == sz + 1) continue;
                //if(mp[{clc[yc][r - 1], to.x}] == 0 || mp[{clc[yc][r - 1], to.x}] < v[yc][r - 1] - to.y.y) 
                //{
                //    mp[{clc[yc][r - 1], to.x}] = v[yc][r - 1] - to.y.y;
                    q.push({clc[yc][r - 1], to.y.y, to.x});
                //}
            }
        }
    }
    
    rep(i, 1, n) cout << f[i]; cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T = 1; cin >> T;
    while(T--) solve();
}