#include <iostream>
using namespace std;

int main(){
	int n,m,k;
	int inf=0x7fffffff;
	cin>>n>>m>>k;
	int t[n][n];
	int y[n]; // ζֵ-1 ʾûв 
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			t[i][j] = inf;
		}
		t[i][i] = 0;
		y[i] = -1;
	}
	for(int i=0;i<m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		u--;
		v--;
		t[u][v] = w;
		t[v][u] = w;
	}
	for(int i=0;i<m;i++){
		int u,my;
		cin>>u>>my;
		y[u]=my;
	}
	
	for(int k=0;k<n;k++)
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				if(t[i][j] > t[i][k]+t[k][j])
					t[i][j] = t[i][k]+t[k][j],t[j][i] = t[i][j];
	
	
	for(int i=0;i<n-1;i++){
		bool isFound = false;
		for(int j=0;j<k;j++){
//			if(grasses[j].u==i){
//				cout<<1<<endl;
//				isFound = true;
//				break;
//			}else
			{
				int indx = grasses[j].distIndex;
				int gIndx = grasses[j].u;
				if(dists[indx][i]+dists[0][gIndx]-grasses[j].y<dists[0][i]){
					cout<<1<<endl;
					isFound = true;
					break;
				}
			}			
		}
		if(!isFound) cout<<0<<endl;
	}
		
	return 0;
}