#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

#define NMax 1510
#define INF 2000000000

using namespace std;

ifstream f("dmin.in");
ofstream g("dmin.out");

int nodes, edges, roadsNum[NMax];
long long distances[NMax];
vector < pair<long long, long long> > G[NMax];
queue <int> QU;
bool mark[NMax], isInQu[NMax];

class cmp {
public:
	bool operator() (pair<long long, long long> d1, pair<long long, long long> d2)
	{
		return d1.second > d2.second;
	}
};
priority_queue< pair<long long, long long>, vector< pair<long long, long long> >, cmp > H;

void dijkstra(int node)
{
	for (int i = 2; i <= nodes; i++)
		distances[i] = INF;

	H.push(make_pair(node, 0));

	while (!H.empty()) {
		int crtNode = H.top().first;
		mark[crtNode] = true;
		H.pop();

		for (vector < pair<long long, long long> >::iterator it = G[crtNode].begin(); it != G[crtNode].end(); it++) {
			if (!mark[it->first] && distances[it->first] > distances[crtNode] + it->second) {
				distances[it->first] = distances[crtNode] + it->second;
				H.push(make_pair(it->first, distances[it->first]));
			}
		}
	}
}

void BFS(int node)
{
	QU.push(node);
	mark[node] = true;
	isInQu[node] = true;
	roadsNum[node] = 1;


	while (!QU.empty()) {
		int crtNode = QU.front();
		mark[crtNode] = true;
		QU.pop();

		for (vector < pair<long long, long long> >::iterator it = G[crtNode].begin(); it != G[crtNode].end(); it++) {
			if (!mark[it->first] && distances[it->first] == distances[crtNode] + it->second) {
				if (!isInQu[it->first]) {
					QU.push(it->first);
					isInQu[it->first] = true;
				}
				
				roadsNum[it->first] += roadsNum[crtNode];
			}
		}
	}
}

int main()
{
	f >> nodes >> edges;
	
	int n1, n2, c;
	for (int i = 1; i <= edges; i++) {
		f >> n1 >> n2 >> c;
		
		G[n1].push_back(make_pair(n2, c));
		G[n2].push_back(make_pair(n1, c));
	}

	dijkstra(1);

	memset(mark, 0, sizeof(mark));

	BFS(1);

	for (int i = 2; i <= nodes; i++)
		g << roadsNum[i] << " ";

	return 0;
}