#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<queue>
using namespace std;
int n;
long long maxm = 999999999;
long long **dist;
long long **dist1;
bool **valid;
void floyd() {
        for(int k=0;k<n;k++)
                for(int i=0;i<n;i++)
                        for(int j=0;j<n;j++) {
                                if(dist[i][k]+dist[k][j]<dist[i][j] && (valid[i][k] && valid[k][j])){
                                        dist[i][j]=dist[i][k]+ dist[k][j];
                                        valid[i][j] = true;
                        }
        }
        return;
}
		
int main() {
	int m,k,q;
	scanf("%d %d %d %d",&n,&m,&k,&q);
		
		valid = (bool **)malloc(n*sizeof(bool*));
		dist = (long long int**)malloc(n*sizeof(long long int*));
		for(int i=0;i<n;i++){
			*(valid+i) = (bool*)malloc(n*sizeof(bool));
			*(dist+i) = (long long int*)malloc(n*sizeof(long long int));
			for(int j=0;j<n;j++)
				dist[i][j]=maxm;
		}
		for(int i=0;i<k;i++)
			valid[i][i]=true;
		for(int j=0;j<m;j++)
		{
			int u,v,c;
			scanf("%d %d %d",&u,&v,&c);
			u--,v--;
			if(valid[u][u] || valid[v][v])
				valid[u][v]=true, dist[u][v]=c;
		}
		floyd();
		int cnt=0;
		long long sum=0;
		for(int i=0;i<q;i++)
		{
			int u, v;
			scanf("%d %d",&u,&v);
			u--,v--;	
			if(valid[u][v] && dist[u][v]!=maxm){
				sum+= dist[u][v];
				cnt++;
			}
		}
		printf("%d\n",cnt);
		printf("%lld\n",sum);
	return 0;
}