#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e5 + 5, mod1 = 1e9 + 7, mod2 = 1000000123;
vector<pair<int, int> > adj[N];
pair<int, int> dis[N];
bool vis[N];

int fastPower(int b, int p, int mod) {
    if (p == 0)return 1;
    int ans = fastPower(1ll * b * b % mod, p / 2, mod);
    return p % 2 ? 1ll * ans * b % mod : ans;
}

pair<int, int> getCost(int x) {
    if (x > 0)return {x, x};
    return {fastPower(-x, mod1 - 2, mod1), fastPower(-x, mod2 - 2, mod2)};
}

pair<int, int> mul(pair<int, int> a, pair<int, int> b) {
    return {1ll * a.first * b.first % mod1, 1ll * a.second * b.second % mod2};
}

bool solve(int node) {
    queue<int> q;
    q.push(node);
    vis[node] = true;
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto child: adj[node]) {
            pair<int, int> d = mul(dis[node], getCost(child.second));

            if (d == dis[child.first])continue;
            if (vis[child.first]) {
                return true;
            }
            vis[child.first] = true;
            dis[child.first] = d;
            q.push(child.first);
        }
    }
    return false;
}

void doWork() {
    int n, m;

    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, x, b;
        cin >> a >> b >> x;
        adj[a].push_back({b, x});
        adj[b].push_back({a, -x});
    }

    for (int i = 1; i <= n; i++) {
        dis[i] = {1, 1};
    }

    for (int i = 1; i <= n; i++) {
        if (vis[i])continue;
        if (solve(i)) {
            cout << "No";
            return;
        }
    }
    cout << "Yes";
}

int main() {
    IO
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}