#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(dst, N) for (int dst = 0; dst < (int)(N); ++dst)
#define all(C) begin(C), end(C)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl

int N, M;
vector<vector<pair<int, int>>> g, rg;

int dpb[100010], dpr[100010];

int blue(int u) {
    int &res = dpb[u];
    if (res != -1) return res;
    res = 0;
    for (auto &e : rg[u]) res = max(res, blue(e.first) + e.second);
    return res;
}

int red(int u) {
    int &res = dpr[u];
    if (res != -1) return res;
    res = 1e9;
    for (auto &e : g[u]) res = min(res, red(e.first) - e.second);
    return res;
}

int main() {
    cin >> N >> M;
    g.assign(N, {});
    rg.assign(N, {});
    memset(dpb, -1, sizeof dpb);
    memset(dpr, -1, sizeof dpr);
    for (int i = 0; i < M; i++) {
        int A, B, C;
        cin >> A >> B >> C;
        g[A].emplace_back(B, C);
        rg[B].emplace_back(A, C);
    }
    blue(N - 1);
    dpr[N - 1] = dpb[N - 1];
    red(0);
    int p = 0;
    for (int i = 0; i < N; i++) {
        if (dpb[i] != dpr[i]) ++p;
    }
    printf("%d %d/%d\n", blue(N - 1), p, N);
}