#include <iostream>
#include <vector>
#include <limits>

    int n, m;
    std::vector<std::vector<int> > edge;    // 隣接行列
    std::vector<int> ent, lnt;
    std::vector<int> rec, ser;

void calc_ent(int node) {
    if (rec[node] != 0) {
        return;
    }
    for (int i = 0; i < n; i++) {
        if (edge[node][i] != -1) {
            int t = ent[node] + edge[node][i];
            if (t > ent[i]) {
                ent[i] = t;
            }
            rec[i]--;
            calc_ent(i);
        }
    }
    rec[node]--;
    return;
}

void calc_lnt(int node) {
    if (ser[node] != 0) {
        return;
    }
    for (int i = 0; i < n; i++) {
        if (edge[i][node] != -1) {
            int t = lnt[node] - edge[i][node];
            if (t < lnt[i]) {
                lnt[i] = t;
            }
            ser[i]--;
            calc_lnt(i);
        }
    }
    ser[node]--;
    return;
}

int main() {
    int tmp[3] = {0};
    int c = 0;
    std::cin >> n >> m;
    edge.resize(n);
    for (int i = 0; i < n; i++) {
        edge[i].resize(n, -1);
    }
    ent.resize(n, 0);
    ent[0] = 0;
    lnt.resize(n, std::numeric_limits<int>::max());
    rec.resize(n, 0);
    ser.resize(n, 0);
    for (int i = 0; i < m; i++) {
        std::cin >> tmp[0] >> tmp[1] >> tmp[2];
        if (tmp[2] > edge[tmp[0]][tmp[1]]) {
            edge[tmp[0]][tmp[1]] = tmp[2];
            ser[tmp[0]]++;
            rec[tmp[1]]++;
        }
    }
    calc_ent(0);
    lnt[n-1] = ent[n-1];
    calc_lnt(n-1);
    for (int i = 0; i < n; i++) {
        if (lnt[i] != ent[i]) {
            c++;
        }
    }
    std::cout << ent[n-1] << " " << c << "/" << n << std::endl;
    
}