#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 11;
int res = 0;
set <pair <int, int>> g[N];
int markarestas[N], markvertices[N];
int ans = 0;
int n;
void backtracking(){
ans = max(ans, res);
for(int i = 1;i <= n;i++){
if(markvertices[i] == 1) continue;
markvertices[i] = 1;
vector <array <int, 4>> arestas;
for(auto [x, w] : g[i]){
for(auto [y, w2] : g[i]){
if(x == y) continue;
arestas.push_back({x, y, w, w2});
}
}
for(auto [x, y, w,w2] : arestas){
g[i].erase({x, w});
g[i].erase({y, w2});
g[x].erase({i, w});
g[y].erase({i, w2});
res += w+w2;
backtracking();
res -= w+w2;
g[i].insert({x, w});
g[i].insert({y, w2});
g[x].insert({i, w});
g[y].insert({i, w2});
}
markvertices[i] = 0;
}
}
int32_t main(){
cin >> n;
for(int i = 1;i < n;i++){
int a, b, w;
cin >> a >> b >> w;
g[a].insert({b, w});
g[b].insert({a, w});
}
backtracking();
cout << ans << '\n';
}
