#line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <tuple>
#include <cassert>
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"
template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return true;
}
return false;
}
/**
* @title Chmin/Chmax
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"
#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"
class range {
public:
class iterator {
private:
int64_t M_position;
public:
constexpr iterator(int64_t position) noexcept: M_position(position) { }
constexpr void operator ++ () noexcept { ++M_position; }
constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
constexpr int64_t operator * () const noexcept { return M_position; }
};
class reverse_iterator {
private:
int64_t M_position;
public:
constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
constexpr void operator ++ () noexcept { --M_position; }
constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
constexpr int64_t operator * () const noexcept { return M_position; }
};
private:
const iterator M_first, M_last;
public:
constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
constexpr iterator begin() const noexcept { return M_first; }
constexpr iterator end() const noexcept { return M_last; }
constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); }
constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); }
};
/**
* @title Range
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"
#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"
template <class T>
class rev_impl {
public:
using iterator = typename std::decay<T>::type::reverse_iterator;
private:
const iterator M_begin;
const iterator M_end;
public:
constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
constexpr iterator begin() const noexcept { return M_begin; }
constexpr iterator end() const noexcept { return M_end; }
};
template <class T>
constexpr decltype(auto) rev(T &&cont) {
return rev_impl<T>(std::forward<T>(cont));
}
/**
* @title Reverser
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"
#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"
template <class Func>
struct fix_point_impl: private Func {
explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { }
template <class... Args>
constexpr decltype(auto) operator () (Args &&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
constexpr decltype(auto) fix_point(Func &&func) {
return fix_point_impl<Func>(std::forward<Func>(func));
}
/**
* @title Lambda Recursion
*/
#line 19 "main.cpp"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;
struct edge_t {
i32 to, col;
};
int main() {
i32 N;
std::cin >> N;
assert(N <= 10);
std::vector<std::tuple<i32, i32, i32>> edges(N - 1);
edges.reserve(N - 1);
for (auto &[u, v, c]: edges) {
std::cin >> u >> v >> c;
--u; --v;
}
i32 ans = 0;
for (auto S: range(1, 1 << (N - 1))) {
std::vector<std::vector<edge_t>> graph(N);
for (auto i: range(0, N - 1)) {
auto [u, v, c] = edges[i];
graph[u].push_back(edge_t{ v, S >> i & 1 });
graph[v].push_back(edge_t{ u, S >> i & 1 });
}
bool valid = false;
for (auto src: range(0, N)) {
std::vector<bool> root(N), mid(N);
fix_point([&](auto dfs, i32 u, i32 p) -> void {
bool exist = false;
i32 cnt = 0;
for (auto [v, c]: graph[u]) {
if (v == p) continue;
dfs(v, u);
if (!c && !root[v]) {
root[u] = mid[u] = false;
return;
}
if (!root[v] && !mid[v]) {
root[u] = mid[u] = false;
return;
}
if (c && root[v]) {
exist = true;
if (!mid[v]) {
++cnt;
}
}
}
root[u] = (cnt == 0);
mid[u] = (exist && cnt <= 1);
})(src, -1);
if (root[src]) {
valid = true;
break;
}
}
if (valid) {
i32 sum = 0;
for (auto i: range(0, N - 1)) {
if (S >> i & 1) {
sum += std::get<2>(edges[i]);
}
}
chmax(ans, sum);
}
}
std::cout << ans << '\n';
return 0;
}
