89分求调！

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, dis[20005], f[10005][10005];
vector <int> g[20005]; 
queue <int> q;
bool vis[20005];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 'A'; i <= 'z'; i++)
		for(int j = 'A'; j <= 'z'; j++)
			if(i != j)
				f[i][j] = 0x3f3f3f3f;
	for(int i = 1; i <= n; i++) {
		char u, v;
		int w;
		cin >> u >> v >> w;
		f[u][v] = min(f[u][v], w);
		f[v][u] = min(f[u][v], f[v][u]);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	memset(dis, 0x7f, sizeof dis);
	q.push('Z'), dis['Z'] = 0;
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		if(vis[u])
			continue;
		vis[u] = 1;
		for(auto & e : g[u]) {
			int v = e;
			if(dis[v] > dis[u] + f[u][v]) {
				dis[v] = dis[u] + f[u][v];
				q.push(v);
			}
		}
	}
	char ans;
	int sum = 0x7f7f7f7f7f7f7f7f;
	for(int i = 65; i <= 89; i++)
		if(dis[i] < sum)
			sum = dis[i], ans = (char)i;
	cout << ans << " " << sum << endl;
	return 0;
}