#include<bits/stdc++.h>

using namespace std;

int n,m;

map<string,int>si;

map<int,string>is;

const int N=;

int weight[N];

int mp[N][N];

const int inf=0x3f3f3f3f;

int dis[N];

bool vis[N];

int num[N];

int w[N];

int past[N];

int path[N];

void Dijkstra(int v)

{

    fill(vis,vis+N,false);

    fill(dis,dis+N,inf);

    fill(w,w+N,);

    fill(num,num+N,);

    fill(past,past+N,);

    fill(path,path+N,);

    //for(int i=0;i<=n-1;i++) dis[i]=mp[v][i];

    dis[v]=;

    num[v]=;

    for(int i=;i<n;i++){

        int u=-;

        int minn=inf;

        for(int j=;j<n;j++){

            if(!vis[j]&&minn>dis[j]){

                u=j;

                minn=dis[j];

            }

        }

        if(u==-) return;

        vis[u]=true;

        for(int j=;j<n;j++){

            if(!vis[j]&&mp[u][j]!=inf){

                if(dis[j]>dis[u]+mp[u][j]){//第一标尺: 最短路径

                    dis[j]=dis[u]+mp[u][j];

                    num[j]=num[u];

                    w[j]=w[u]+weight[j];

                    past[j]=past[u]+;//s->j顶点个数等于s->u顶点个数+1

                    path[j]=u;//更新路径

                }

                else if(dis[j]==dis[u]+mp[u][j]){

                    num[j]+=num[u];

                    if(w[u]+weight[j]>w[j]){//第二标尺:结点的值

                        w[j]=w[u]+weight[j];

                        past[j]=past[u]+;

                        path[j]=u;

                    }

                    else if(w[u]+weight[j]==w[j]){

                        double uAvg=1.0*(w[u]+weight[j])/(past[u]+);

                        double vAvg=1.0*w[j]/past[j];

                        if(uAvg>vAvg){//第三标尺:平均结点值

                            past[j]=past[u]+;

                            path[j]=u;

                        }

                    }

                }

            }

        }

    }

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    cout.tie();

    fill(mp[],mp[]+N*N,inf);

    fill(weight,weight+N,);

    cin>>n>>m;

    string t;

    cin>>t;

    si[t]=;

    is[]=t;

    for(int i=;i<=n-;i++){

        string temp;

        cin>>temp;

        cin>>weight[i];

        si[temp]=i;

        is[i]=temp;

    }

    for(int i=;i<m;i++){

        string a,b;

        cin>>a>>b;

        int num;

        cin>>num;

        int a1=si[a];

        int b1=si[b];

        mp[a1][b1]=mp[b1][a1]=num;

    }

    Dijkstra();

    int rom=si["ROM"];

    cout<<num[rom]<<" "<<dis[rom]<<" "<<w[rom]<<" "<<w[rom]/past[rom]<<endl;

    int tt=rom;

    vector<int>vec;

    while(tt!=){

        vec.push_back(tt);

        tt=path[tt];

    }

    reverse(vec.begin(),vec.end());

    cout<<t<<"->";

    for(int i=;i<vec.size();i++){

        if(i) cout<<"->";

        cout<<is[vec[i]];

    }

    cout<<endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,m;

map<string,int>si;

map<int,string>is;

const int N=;

int weight[N];

int mp[N][N];

const int inf=0x3f3f3f3f;

int dis[N];

bool vis[N];

vector<int>path[N];

void Dijkstra(int v)

{

    fill(vis,vis+N,false);

    fill(dis,dis+N,inf);

    for(int i=;i<n;i++) dis[i]=mp[v][i];

    dis[v]=;

    for(int i=;i<n;i++){

        int u=-;

        int minn=inf;

        for(int j=;j<n;j++){

            if(!vis[j]&&minn>dis[j]){

                minn=dis[j];

                u=j;

            }

        }

        if(u==-) return;

        vis[u]=true;

        for(int j=;j<n;j++){

            if(!vis[j]&&mp[u][j]!=inf){

                if(dis[j]>mp[u][j]+dis[u]){

                    dis[j]=mp[u][j]+dis[u];

                    path[j].clear();

                    path[j].push_back(u);

                }

                else if(dis[j]==mp[u][j]+dis[u]){

                    path[j].push_back(u);

                }

            }

        }

    }

}

vector<int>t,tt;

int minDis=inf;

int maxValue=-;

int sum=;

int num=;

void dfs(int v)

{

    if(v==){

        sum++;

        t.push_back(v);

        int sumDis=;

        int sumValue=;

        sumValue=weight[t[t.size()-]];

        for(int i=t.size()-;i>=;i--){

           // sumDis+=mp[t[i+1]][t[i]];

            sumValue+=weight[t[i]];

        }

        //注意这里不再需要管最短路径这个第一标尺 因为我们用Dijkstra求出来了

        // 这几条路径

        //的长度是一样的并且是都是最小的

        if(maxValue<sumValue){

            maxValue=sumValue;

            tt=t;

        }

        else if(sumValue==maxValue){

            double a=1.0*sumValue/tt.size();

            double b=1.0*maxValue/t.size();

            if(a<b){

                tt=t;

            }

        }

        t.pop_back();

        return;

    }

    t.push_back(v);

    for(int i=;i<path[v].size();i++){

        dfs(path[v][i]);

    }

    t.pop_back();

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    cout.tie();

    fill(mp[],mp[]+N*N,inf);

    fill(weight,weight+N,);

    cin>>n>>m;

    string t;

    cin>>t;

    si[t]=;

    is[]=t;

    for(int i=;i<=n-;i++){

        string temp;

        cin>>temp;

        cin>>weight[i];

        si[temp]=i;

        is[i]=temp;

    }

    for(int i=;i<m;i++){

        string a,b;

        cin>>a>>b;

        int num;

        cin>>num;

        int a1=si[a];

        int b1=si[b];

        mp[a1][b1]=mp[b1][a1]=num;

    }

    Dijkstra();

    int rom=si["ROM"];

    dfs(rom);

    cout<<sum<<" "<<dis[rom]<<" "<<maxValue<<" "<<maxValue/(tt.size()-)<<endl;

    reverse(tt.begin(),tt.end());

    for(int i=;i<tt.size();i++){

        if(i) cout<<"->";

        cout<<is[tt[i]];

    }

    cout<<endl;

    return ;

}