#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Point{
    bool vertex;
    int index_prev;
    Point():vertex(false), index(0){}
    Point(bool _vertex, int _index_prev):vertex(_vertex), index_prev(_index_prev){}
};
class Graf{
private:
    double **graf;
    int d;
    vector<int> str;
public:
    Graf(int i, int start): d(i){
        str.push(start);
        graf = new double *[d];
        for(int i = 0; i < d; i++)
            graf[i] = new double[d];
        for(int i = 0; i < d; i++){
            for(int j = 0; j < d; j++)
                  graf[i][j] = 0;
        }
    }
    Graf(const Graf &origin){
        d = origin.d;
        graf = new double*[d];
        for (int i = 0; i < d; i++)
            graf[i] = new double[d];
        for (int i = 0; i < d; i++){
            for (int j = 0; j < d; j++){
                graf[i][j] = origin.graf[i][j];
            }
        }
    }
   /* Graf &operator = (Graf const &origin){
            Graf temp(origin);
            d = temp.d;
            for(int i = 0; i < d; i++){
                for(int j = 0; j < d; j++)
                    graf[i][j] = origin.graf[i][j];
            }
        return *this;
    }*/
    ~Graf(){
            for (int i = 0; i < d; i++)
                delete[] graf[i];
            delete[] graf;
        }
    void matrix(char i, char j, double weight){
        graf[i][j] = weight;
    }
    void Display(){
        for(int i = 0; i < d; i++){
            for(int j = 0; j < d; j++){
                cout << graf[i][j] << " ";
            }
            cout << endl;
        }
    }
    void print(char start){
        for(int i = 0; i < str.size(); i++)
            cout <<(char)(str[i] + start)<<" ";
        cout << endl;
    }

    void min_way(){

    }
};

int main() {
    char start, the_end, from, to;
    cin>> start >> the_end;
    Graf matr(the_end - start + 1, 0);
    double weight;
    while(cin >> from >> to >> weight){
        matr.matrix(from-start, to-start, weight);
    }
  //  matr.Display();
    matr.min_way();
    return 0;
}