include [HTML_REMOVED]
include [HTML_REMOVED]
using namespace std;
const int N = 1e5 + 10,M = 55;
int g[55][55];
int dist[M];
bool st[M];
int p;
void dijkstra(){
memset(dist, 0x3f, sizeof dist);
dist[52] = 0;
for(int i=1;i<=52;i){
int t = -1;
for(int j=52;j>=1;j–){
if(!st[j] && (t==-1 || dist[j] < dist[t])) t = j;
}
st[t] = true;
for(int k=52;k>=1;k–){
dist[k] = min(dist[k], dist[t] + g[t][k]);
}
}
int mi = 52, ans =2e9;
for(int i=27;i<=51;i){
if(dist[i] < ans){
ans = dist[i];
mi = i;
}
}
cout << (char)(mi- 27 + ‘A’) << ‘ ‘ << ans;
}
int main(){
memset(g,0x3f,sizeof g);
cin >> p;
while(p –){
char sa,sb;
int a,b,c;
cin >> sa >> sb >> c;
if(sa>=’a’) a = sa - ‘a’ + 1;
else a = sa - ‘A’ + 27;
if(sb >= ‘a’) b = sb - ‘a’ + 1;
else b = sb - ‘A’ + 27;
g[a][b] = min(g[a][b], c);
g[b][a] = min(g[b][a], c);
}
dijkstra();
return 0;
}