#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



template<class T> struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
    friend bool operator < (const Edge &e1, const Edge &e2) {return e1.cost < e2.cost;}
    friend bool operator > (const Edge &e1, const Edge &e2) {return e1.cost > e2.cost;}
    friend ostream& operator << (ostream& s, const Edge<T>& E) {
        return s << E.from << "->" << E.to << '(' << E.cost << ')';
    }
};

const int MAX_V = 2100;
template<class T> struct Graph {
    int V;
    vector<Edge<T> > list[MAX_V];
    
    Graph(int n = 0) : V(n) {}
    void init(int n = 0) {V = n; for (int i = 0; i < MAX_V; ++i) list[i].clear();}
    inline vector<Edge<T> >& operator [] (int i) {return list[i];}
    
    void connect(int f, int t, T c) {
        list[f].push_back(Edge<T>(f,t,c));
        list[t].push_back(Edge<T>(t,f,c));
    }
    
    friend ostream& operator << (ostream& s, const Graph& G) {
        s << endl; for (int i = 0; i < G.V; ++i) {s << i << " : " << G.list[i] << endl;}return s;
    }
};

Graph<int> G;
const int MAX_UF = MAX_V;
struct UnionFind {    
    int size_;
    int par[MAX_UF];
    int rank[MAX_UF];
    
    UnionFind(int n = 0) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    void init(int n) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    int root(int x) {return par[x] == x ? x : par[x] = root(par[x]);}    
    bool same(int x, int y) {return root(x) == root(y);}
    
    void connect(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return;        
        if (rank[x] < rank[y]) par[x] = y;
        else {par[y] = x; if (rank[x] == rank[y]) ++rank[x];}
    }
};

Graph<int> tree;
UnionFind uf;

template<class T> T Kruskal(Graph<T> &G) {
    T res = 0.0;
    tree.init(G.V);
    uf.init(G.V);
    vector<Edge<T> > edges;
    for (int v = 0; v < G.V; ++v) {
        for (int i = 0; i < G[v].size(); ++i) {
            edges.push_back(G[v][i]);
        }
    }
    sort(edges.begin(), edges.end());
    for (int i = 0; i < edges.size(); ++i) {
        Edge<T> e = edges[i];
        if (!uf.same(e.from, e.to)) {
            uf.connect(e.from, e.to);
            res += e.cost;
            tree[e.from].push_back(Edge<T>(e.from, e.to, e.cost));
            tree[e.to].push_back(Edge<T>(e.to, e.from, e.cost));
        }
    }
    return res;
}


int N, M;
int a, b, c;
int graph[510][510];

bool seen[2100];
vint comp[3];
void dfs(int u, int id) {
    seen[u] = true;
    for (int i = 0; i < tree[u].size(); ++i) {
        int to = tree[u][i].to;
        if (seen[to]) continue;
        dfs(to, id);
    }
    comp[id].PB(u);
}

int main() {
    //freopen( "/Users/macuser/Dropbox/Contest/input.in", "r", stdin );
    while (cin >> N >> M) {
        for (int i = 0; i < 510; ++i) for (int j = 0; j < 510; ++j) graph[i][j] = 1<<29;
        
        G.init(N);
        for (int i = 0; i < M; ++i) {
            cin >> a >> b >> c;
            --a; --b;
            G.connect(a, b, c);
            graph[a][b] = c; graph[b][a] = c;
        }
        Kruskal(G);
        
        //COUT(G); COUT(tree);
        
        int res = 0, tot = 0;
        for (int i = 0; i < tree.V; ++i) {
            for (int j = 0; j < tree[i].size(); ++j) {
                int from = i, to = tree[i][j].to, cost = tree[i][j].cost;
                if (from > to) continue;
                
                //cout << endl; COUT(from); COUT(to); COUT(cost);
                
                memset(seen, 0, sizeof(seen));
                seen[from] = true; seen[to] = true;
                comp[0].clear(); comp[1].clear();
                dfs(from, 0);
                dfs(to, 1);
                
                //COUT(comp[0]); COUT(comp[1]);
                
                bool ok = true;
                for (int p = 0; p < comp[0].size(); ++p) {
                    for (int q = 0; q < comp[1].size(); ++q) {
                        int f = comp[0][p], t = comp[1][q];
                        
                        if (f == from && t == to) continue;
                        
                        int co = graph[f][t];
                        if (co == cost) ok = false;
                    }
                }
                if (ok) {
                    ++res;
                    tot += cost;
                }
            }
        }   
        
        cout << res << " " << tot << endl;
    }
    return 0;
}
