#include <bits/stdc++.h>
using namespace std;

struct Edge {
    int v;
    int w;
};

vector<Edge> g[100000];

int cost[100000];
bool vis[100000];

void dfs(int u) {
    if (cost[u] != 0) {
        return;
    }
    for (Edge e : g[u]) {
        dfs(e.v);
        cost[u] = max(cost[u], cost[e.v] + e.w);
    }
}

void dfs2(int u) {
    if (vis[u]) {
        return;
    }
    vis[u] = true;
    for (Edge e : g[u]) {
        if (cost[u] == cost[e.v] + e.w) {
            dfs2(e.v);
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        g[a].push_back({ b, c });
    }
    dfs(0);
    dfs2(0);

    int cnt = 0;
    for (int i = 0; i < n; i++) {
        cnt += vis[i];
    }
    cout << cost[0] << " " << (n - cnt) << "/" << n << endl;
}