#include using namespace std; typedef long long ll; typedef vector vll; typedef vector vvll; typedef pair P; typedef string str; typedef vector

vp; typedef vector vs; typedef vector vb; const ll mod=1e9; const ll inf=1e16; #define rep(i,m,n) for(ll i=m;i=n;i--) #define fi first #define se second #define chmax(x,y) x=max(x,y) #define chmin(x,y) x=min(x,y) #define eb(x) emplace_back(x) #define pb(x) pop_back(x) #define all(x) x.begin(),x.end() #define allr(x) x.rbegin(),x.rend() #define sum(x) accumulate(all(x),0) #define pc(x) __builtin_popcount(x) #define gll greater() void solve(){ ll n,m; cin >> n >> m; vll num(n); rep(i,0,n) num[i]=i; vp p(m); vll s(m); rep(i,0,m) cin >> p[i].fi >> p[i].se >> s[i]; ll ans=0; do{ ll tot=0; rep(i,0,m){ if(num[p[i].fi]