GRL_2_A.test.cpp

#define PROBLEM \
  "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A"
#include "my_template.hpp"
#include "other/io.hpp"
#include "graph/minimum_spanning_tree.hpp"

void solve() {
  LL(N, M);
  Graph<int, 0> G(N);
  G.read_graph(M, 1, 0);
  auto [cost, in_mst, tree] = minimum_spanning_tree<ll>(G);
  print(cost);
}

signed main() {
  solve();
  return 0;
}