RE，WA，TLE，AC（样例+1个测试点）

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10;
int h[N], e[N], ne[N], w[N], idx, x[N];
bool b[N];
inline void add(int a, int b, int c) {
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
inline void dfs(int xx, int fa) {
	b[xx] = 1;
	for (int i = h[xx]; i != -1; i = ne[i]) {
		int u = e[i];
		x[u] = x[xx] + w[i];
		dfs(u, xx);
	}
}
signed main() {
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	memset(h, -1, sizeof h);
	int n, m;
	cin >> n >> m;
	for (int i = 1, u, v, w; i <= m; i++) {
		cin >> u >> v >> w;
		add(v, u, -w);
		//for (int i = h[ver]; i != -1; i = ne[i])
	}
	for (int i = 1; i <= n; i++) {
		if (!b[i])
			dfs(i, 0);
	}
	for (int i = 1; i <= n; i++) {
		cout << x[i] << ' ';
	}
	return 0;
}