#include<fstream>
#include<algorithm>
#include<cmath>
#include<string>
#include<list>
#include<vector>
#include<deque>
#include<queue>
#include<map>

using namespace std;
ifstream fi("t2bb.in");
ofstream fo("t2bb.out");

int main()
{
	int n,m;
	int road[501][501]={0};
	int t1,t2,t3;
	fi>>n>>m;
	for(int i=0;i<m;i++)
	{
		fi>>t1>>t2>>t3;
		road[t1][t2]=t3;
		road[t2][t1]=t3;
	}
	int min=999999999,t;
	for(int i=0;i<n;i++)
	{
		t=0;
		for(int j=0;j<n;j++)
			t+=road[i][j];
		if(t<min)min=t;
	}
	fo<<min;
	fi.close();
	fo.close();
	return 0;
}