#include <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define maxN 100
struct ncon{int v,l;};


int n,m,k;
vector<vector<ncon> > mvei;
vector<int> viz;
FILE*fi,*fo;


void inputFunc(){
	fi=fopen("radiatie.in","r");fo=fopen("radiatie.out","w");
	fscanf(fi,"%d %d %d", &n, &m, &k);
	
	mvei.assign(n, vector<ncon>());
	
	for(int i=0;i<m;i++){
		int a,b,c;fscanf(fi,"%d %d %d",&a,&b,&c);a--,b--;
		ncon aux;aux.l=c;
		aux.v=a;mvei[b].push_back(aux);
		aux.v=b;mvei[a].push_back(aux);
	}
}

void outputFunc(){	
	fclose(fi);fclose(fo);
}
bool pred(const ncon&a,const ncon&b){return a.l<b.l;}


struct nod{int a,b,c;};
class predn{
	public:
		int operator()(const nod&a,const nod&b){
			return a.c<b.c;
		}
};

int main(){
	inputFunc();
	for(int i=0;i<n;i++)sort(mvei[i].begin(), mvei[i].end(), pred);
	
	for(int i=0;i<k;i++){
		int st,en;fscanf(fi,"%d %d",&st,&en);st--,en--;
		viz.assign(n,-1);viz[st]=0;
		priority_queue<nod,vector<int>,predn> qu;
		
		
	}
	
	outputFunc();
	return 0;
}