#include<iostream>
#include<cstring>
using namespace std;
const int inf=1000000000;
int N,M,K,Ds,e[1100][1100],d[1100];
bool vis[1100];
int getID(string s){
int res=0;
for(int i=0;i<s.length();i++)
if(s[i]!='G') res=res*10+s[i]-'0';
if(s[0]=='G') res+=N;
return res;
}
void dijkstra(int start){
fill(d,d+1100,inf);
memset(vis,false,sizeof(vis));
d[start]=0;
for(int i=1;i<=N+M;i++){
int u=-1,minn=inf;
for(int j=1;j<=M+N;j++){
if(vis[j]==false&&d[j]<minn){
u=j;
minn=d[j];
}
}
if(u==-1) break;
vis[u]=true;
for(int v=1;v<=M+N;v++){
if(vis[v]==false&&e[u][v]!=inf){
if(d[v]>d[u]+e[u][v]){
d[v]=d[u]+e[u][v];
}
}
}
}
}
int main(){
string name1,name2;
int t;
fill(e[0],e[0]+1100*1100,inf);//不要忘了!!!
scanf("%d%d%d%d",&N,&M,&K,&Ds);
for(int i=0;i<K;i++){
cin>>name1>>name2>>t;
int id1=getID(name1);
int id2=getID(name2);
e[id1][id2]=e[id2][id1]=t;
}
int ansID=-1;
double ansDis=-1,ansAvg=inf;
for(int i=N+1;i<=M+N;i++){
dijkstra(i);
double minDis=inf,avg=0;
for(int j=1;j<=N;j++){
if(d[j]>Ds){
minDis=-1;
break;
}
if(d[j]<minDis) minDis=d[j];
avg+=1.0*d[j]/N;
}
if(minDis==-1) continue;
if(minDis>ansDis){//最小距离尽可能大
ansDis=minDis;
ansAvg=avg;
ansID=i;
}else if(minDis==ansDis&&ansAvg>avg){
ansAvg=avg;
ansID=i;
}
}
if(ansID==-1) printf("No Solution\n");
else{
printf("G%d\n",ansID-N);
printf("%.1lf %.1lf\n",ansDis,ansAvg);
}
}