hdu2112

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <map>
using namespace std;
const int _max = 0x3f3f3f3f;
const int maxn = 155;
int way[maxn][maxn];
bool visit[maxn];
int dist[maxn];
string start, end;
int n, ans;

map<string, int> mp;
map<string, bool> dp;

void inint()
{
    mp.clear();//清空映射mp
    dp.clear();//清空映射dp;
    for(int i = 1; i < maxn; i++)//神奇的地方 如果<=就超时，，搞啦一个上午，自杀的心都有了，，
        for(int j = 1; j < maxn; j++)
            if(i==j) way[i][j] = 0;
            else way[i][j] = _max;
}

void input()
{
    ans = 1;
    cin >> start >> end;
    mp[start] = 1;//mp映射该string为1
    dp[start] = true;//dp映射该string为true；
    if(!dp[end])
    {
        mp[end] = ++ans;
        dp[end] = true;
    }
    int cost;
    string str1,str2;
    for(int i = 1; i <= n; i++)
    {
        cin >> str1 >> str2 >> cost;
        if(!dp[str1])
        {
            mp[str1] = ++ans;
            dp[str1] = true;
        }
        if(!dp[str2])
        {
            mp[str2] = ++ans;
            dp[str2] = true;
        }
        way[mp[str1]][mp[str2]] = way[mp[str2]][mp[str1]] = cost;
    }
}

void SPFA()
{
    queue<int>q;
    memset(visit, false, sizeof(visit));
    for(int i = 0; i <= ans; i++) dist[i] = _max;
    dist[1] = 0;
    visit[1] = true;
    q.push(1);
    while(!q.empty())
    {
        int cur = q.front();
        q.pop();
        visit[cur] = false;
        for(int i = 1; i <= ans; i++)
        {
            if(dist[i] > dist[cur] + way[cur][i])
            {
                dist[i] = dist[cur] + way[cur][i];
                if(!visit[i])
                {
                    q.push(i);
                    visit[i] = true;
                }
            }
        }
    }
    if(dist[mp[end]] != _max) printf("%d\n", dist[mp[end]]);
    else printf("-1\n");
}

int main()
{
    while(scanf("%d", &n))
    {
        if(n==-1) break;
        inint();
        input();
        SPFA();
    }
    return 0;
}