#include <bits/stdc++.h> using namespace std; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef pair<int, int> pii ; typedef pair<ll, ll> pll ; typedef vector<pii> vii ; typedef vector<int> veci ; typedef vector<pll> vll ; typedef vector<ll> vecll; // find_by_order order_of_key //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define F first #define S second #define pb push_back #define endl '\n' #define Mp make_pair #define all(x) x.begin(), x.end() #define debug(x) cerr << #x << " = " << x << endl #define set_dec(x) cout << fixed << setprecision(x); #define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout); #define lb lower_bound #define ub upper_bound #define for1(n) for(int i=1;i<=n;i++) #define for0(n) for(int i=0;i<n;i++) #define forn(n) for(int i=n;i>0;i--) #define pq priority_queue <pii, vector<pii>, greater<pii>> const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9; ll inf=1e18; const int N=1e6+100,L=21,bs=701,NN=1e6; int B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dist[N],vis[N]; vector<int>g[N]; pii A[N]; int main(){ fast_io cin>>n>>m; for0(m){ cin>>A[i].F>>A[i].S;int t;cin>>t; if(A[i].F>A[i].S)swap(A[i].F,A[i].S); } int ans=m; for(int msk=0;msk<(1<<m);msk++){ for(int j=0;j<m;j++){ if(msk>>j&1){ pre[A[j].F]++; pre[A[j].S]--; } else{ pre[1]++; pre[A[j].F]--; pre[A[j].S]++; } } int anss=0; for1(n){ pre[i]+=pre[i-1]; anss=max(anss,pre[i]); } ans=min(ans,anss); for1(n)pre[i]=0; }cout<<ans<<endl; }