#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
const int maxn = 1e5 + 5;

vector<pii> g[maxn];
bool vis[maxn];
int dp1[maxn], dp2[maxn], x;
vector<int> vi, vt;

void dfs(int u)
{
	vis[u] = 1;
	vt.emplace_back(u);
	if (dp1[u] > 0) vi.emplace_back(-dp2[u]);
	else vi.emplace_back(dp2[u]);
	for (pii tmp : g[u])
	{
		int v = tmp.first, c = tmp.second;
		if (vis[v])
		{
			if (dp1[u] == -dp1[v] && dp2[u] + dp2[v] != c)
			{
				cout << "NO";
				exit(0);
			}
			else if (dp1[u] + dp1[v])
			{
				int y = (c - dp2[u] - dp2[v]) * 2 / (dp1[u] + dp1[v]);
				if (x == 2e9 + 7) x = y;
				else if (x != y)
				{
					cout << "NO";
					exit(0);
				}
			}
			continue;
		}
		dp1[v] = -dp1[u];
		dp2[v] = c - dp2[u];
		dfs(v);
	}
}
double ans[maxn];

int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		int u, v, c;
		cin >> u >> v >> c;
		g[u].emplace_back(make_pair(v, c));
		g[v].emplace_back(make_pair(u, c));
	}
	
	for (int i = 1; i <= n; i++)
	{
		if (vis[i]) continue;
		dp1[i] = 1, dp2[i] = 0;
		vi.clear(); vt.clear();
		x = 2e9 + 7;
		dfs(i);
		if (x == 2e9 + 7)
		{
			sort(vi.begin(), vi.end());
			x = 2 * vi[vi.size() / 2];
		}
		double tmp = (double)x / 2;
		for (int u : vt) ans[u] = tmp * dp1[u] + dp2[u];
	}
	cout << "YES\n";
	for (int i = 1; i <= n; i++) cout << ans[i] << " ";
	return 0;
}