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

using ll = long long;
using i128 = __int128_t;

constexpr ll P = ll(1e18) + 9;

ll qpow(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b & 1) res = (i128)res * a % P;
        a = (i128)a * a % P, b >>= 1;
    }
    return res;
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector G(n + 1, vector<pair<int, ll>>());
    for(int i = 1; i <= m; i++) {
        int a, x, b;
        cin >> a >> b >> x;
        G[a].push_back({b, x});
        G[b].push_back({a, qpow(x, P - 2)});
    }
    vector<int> vis(n + 1);
    vector<ll> val(n + 1, -1);
    int flg = 1;
    auto dfs = [&](auto self, int x) -> void {
        vis[x] = 1;
        for(auto [y, w] : G[x]) {
            if(!vis[y]) {
                val[y] = (i128)val[x] * w % P;
                self(self, y);
            } else if(val[y] != (i128)val[x] * w % P) {
                flg = 0;
            }
        }
    };
    for(int i = 1; i <= n; i++) if(!vis[i]) {
        val[i] = 1;
        dfs(dfs, i);
    }
    cout << (flg ? "Yes" : "No") << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}