#include<iostream>
#include<vector>
#include<string>
#include<map>
#define INT_MAX 100000000using namespace std;
map<int, string> num_lable;
map<string, int> lable_num;string showpath(int a, int b, vector<vector<int>> path, vector<vector<int>> graph)
{string rt = "";vector<int> temppath = path[a];vector<string> result;result.push_back(num_lable[b]);int cur = b;while (temppath[cur]!=-1){int t = temppath[cur];int dis = graph[cur][t];result.push_back("("+to_string(dis)+")");result.push_back(num_lable[t]);cur = t;}for (int i = result.size() - 1; i >= 0; i--){if (i != 0)rt+= result[i] +"->";elsert+=result[i];}return rt;}int main()
{int p;cin >> p;for (int i = 0; i < p; i++){string tems;cin >> tems;num_lable.insert(pair<int, string>(i, tems));lable_num.insert(pair<string, int>(tems, i));}vector<vector<int>> grah(p, vector<int>(p, INT_MAX));for (int i = 0; i < p; i++){grah[i][i] = 0;}int q;cin >> q;for (int i = 0; i < q; i++){string a, b;int l;cin >> a >> b >> l;int numa = lable_num[a];int numb = lable_num[b];if(l<grah[numa][numb]){grah[numa][numb] = l;grah[numb][numa] = l;}}vector<vector<int>> dis(p, vector<int>(p, 0));//定义距离vector<vector<int>> path(p, vector<int>(p, -1));//定义路径for (int i = 0; i < p; i++){for (int j = 0; j < p; j++){dis[i][j] = grah[i][j];if (i != j&&grah[i][j]<INT_MAX)path[i][j] = i;}}for (int node = 0; node < p; node++){for (int i = 0; i < p; i++){for (int j = 0; j < p; j++){if (dis[i][j]>(dis[i][node] + dis[node][j])){dis[i][j] = dis[i][node] + dis[node][j];path[i][j] = path[node][j];}}}//   displayPath(path);}vector<string> result;int r;cin >> r;for (int i = 0; i < r; i++){string a, b;cin >> a >> b;if (a == b)result.push_back(a);else {int numa = lable_num[a];int numb = lable_num[b];result.push_back(showpath(numa, numb, path, grah));}}for (int i = 0; i < result.size(); i++){cout << result[i] << endl;}system("pause");
}