#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int MAXN=5e5+5;
int Log[MAXN];
struct STlist{
    int n,k;
    vector<vector<int>> maxn;
    STlist(){}
    STlist(vector<int> &a){init(a);}
    void init(vector<int> &a)
    {
        n=a.size();
        k=Log[n]+1;
        maxn.assign(n,vector<int>(k));
        for(int i=0;i<n;i++) maxn[i][0]=a[i];
        for(int j=1;j<k;j++)
            for(int i=0;i+(1<<j)<=n;i++)
                maxn[i][j]=max(maxn[i][j-1],maxn[i+(1<<j-1)][j-1]);
    }
    int query(int l,int r)
    {
        int j=Log[r-l+1];
        return max(maxn[l][j],maxn[r-(1<<j)+1][j]);
    }
};
void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<array<int,3>> e[n+1];
    for(int i=1;i<=m;i++)
    {
        int u,v,c,w;
        cin>>u>>v>>c>>w;
        e[u].push_back({v,c,w});
        e[v].push_back({u,c,w});
    }
    vector<vector<int>> mx(m+1);
    vector<pair<int,int>> a(k+1);
    vector<vector<int>> idx(m+1);
    for(int i=1;i<=k;i++)
    {
        int c,l;cin>>c>>l;
        a[i]={c,l};
        mx[c].push_back(l);
        idx[c].push_back(i);
    }
    vector<STlist> ST(m+1);
    for(int i=1;i<=m;i++)
    {
        if(mx[i].empty()) continue;
        ST[i].init(mx[i]);
    }
    vector<int> ok(n+1),vis(n+1);
    auto dij=[&]()
    {
        priority_queue<array<int,3>,vector<array<int,3>>,greater<>> q;
        q.push({1,0,1});
        while(q.size())
        {
            auto [turn,dis,u]=q.top();q.pop();
            if(vis[u]) continue;
            vis[u]=1;ok[u]=1;
            for(auto [v,C,d]:e[u])
            {
                if(mx[C].empty()) continue;
                auto [c,D]=a[turn];
                if(C==c && d+dis<=D)
                {
                    if(vis[v]==0) q.push({turn,d+dis,v});
                    continue;
                }
                auto pos=lower_bound(idx[C].begin(),idx[C].end(),turn+1);
                if(pos==idx[C].end()) continue;
                int L=distance(idx[C].begin(),pos),R=idx[C].size()-1;
                if(ST[C].query(L,R)<d) continue;
                int l=L,r=R,ans=-1;
                while(l<=r)
                {
                    int mid=l+r>>1;
                    if(ST[C].query(l,mid)>=d)
                    {
                        r=mid-1;
                        ans=idx[C][mid];
                    }
                    else l=mid+1;
                }
                q.push({ans,d,v});
            }
        }
    };
    dij();
    for(int i=1;i<=n;i++) cout<<ok[i];
    cout<<endl;
}
signed main()
{   
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}