#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>

using namespace std;
const ll N=501010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

ll T;
ll n,m,K;
struct E{
    ll to,we,cl;
};
vector <E> e[N];
struct D{
    ll id,di;
};
inline bool operator < (D A,D B) { return A.di > B.di; }
priority_queue <D> q[N];
ll vis[N];

void chushihua() {
    for(ll i=1;i<=n;i++) e[i].clear(), vis[i] = 0;
    for(ll i=1;i<=m;i++) while(!q[i].empty()) q[i].pop();
}

int main() {
    ll x,y,z,cl;
    T = read();
    while(T--) {
        chushihua();
        n = read(); m = read(); K = read();
        for(ll i=1;i<=m;i++) {
            x = read(); y = read(); cl = read(); z = read();
            e[x].push_back({y,z,cl});
            e[y].push_back({x,z,cl});
        }
        vis[1] = 1;
        for(E vv : e[1]) {
            ll v = vv.to, w = vv.we, cl = vv.cl;
            q[cl].push({v,w});
        }
        for(ll i=1;i<=K;i++) {
            cl = read(); z = read();
            while(!q[cl].empty()) {
                D now = q[cl].top();
                if(now.di > z) break;
                q[cl].pop();
                
                ll u = now.id;
                if(vis[u]) continue;
                vis[u] = 1;
                for(E vv : e[u]) {
                    ll v = vv.to, w = vv.we, c = vv.cl;
                    if(c==cl) {
                        q[c].push({v,now.di+w});
                    }
                    else {
                        q[c].push({v,w});
                    }
                }
            }
        }
        for(ll i=1;i<=n;i++) cout<<vis[i];
        cout<<"\n";
    }
    return 0;
}