#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 50005;

struct edge
{
    int from, to, cost;
    bool operator<(const edge& a) const {
        return this->cost < a.cost;
    }
};

class UF {
private:
    int sz; vector<int> par,nrank;
public:
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz,0); rep(i,sz) par[i] = i; }
    int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } }
    void unite(int x,int y)
    { x = find(x),y = find(y); if(x == y) return;
    	if(nrank[x] < nrank[y]) swap(x,y); par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; }
    bool same(int x,int y){ return find(x) == find(y); }
};

edge es[MAX_N];
vector<edge> G[505];
bool used[MAX_N];
bool ans[MAX_N];

bool dfs(int u, int p, const int t, vi& route)
{
    if(u == t) return true;
    each(e,G[u]){
        if(e.to != p){
            route.push_back(e.from);
            if(dfs(e.to,u,t,route)){
                return true;
            }else{
                route.pop_back();
            }
        }
    }
    return false;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    rep(i,m){
        int s,d,c;
        cin >> s >> d >> c;
        es[i] = (edge){s-1,d-1,c};
    }
    sort(es,es+m);
    UF uf(n);
    rep(i,m){
        if(!uf.same(es[i].from,es[i].to)){
            uf.unite(es[i].from,es[i].to);
            used[i] = ans[i] = true;
            G[es[i].from].pb((edge){i,es[i].to,es[i].cost});
            G[es[i].to].pb((edge){i,es[i].from,es[i].cost});
        }
    }
    rep(i,m){
        if(!used[i]){
            vi route;
            dfs(es[i].from,es[i].to,es[i].to,route);
            rep(j,len(route)){
                if(es[route[j]].cost == es[i].cost){
                    ans[route[j]] = false;
                }
            }
        }
    }
    int cnt = 0, sm = 0;
    rep(i,m){
        if(ans[i]) cnt++, sm += es[i].cost;
    }
    cout << cnt << " " << sm << "\n";
    return 0;
}


Measured memory_bytes: 3936