#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename Container>
int SZ(const Container& S) { return S.size(); }

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg_var(x) clog << #x  << ": " << x << endl;
    #define dbg_array(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg_var(x)
    #define dbg_array(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 200100;
vector<int> aa[MAXN];
vector<int> dd[MAXN];
int cc[MAXN];
int min_val[MAXN];
int val[MAXN];

bool dfs(int v, int comp) {
    cc[v] = comp;
    min_val[comp] = min(min_val[comp], val[v]);
    for (int i = 0; i < (int)aa[v].size(); i++) {
        int a = aa[v][i];
        int d = dd[v][i];
        if (cc[a] == -1) {
            val[a] = val[v] + d;
            if (!dfs(a, comp)) return false;
        }
        else if (val[a] != val[v] + d) return false;
    } 
    return true;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        int a, b, d;
        cin >> a >> b >> d;
        aa[a].push_back(b);
        aa[b].push_back(a);
        dd[a].push_back(d);
        dd[b].push_back(-d);
    }
    for (int v = 1; v <= N; v++) cc[v] = -1;
    int components = 0;
    for (int v = 1; v <= N; v++) {
        if (cc[v] == -1) {
            val[v] = 0;
            if (!dfs(v, components)) {
                cout << "No" << "\n";
                return 0;
            }
            components++;
        }
    }
    for (int v = 1; v <= N; v++) val[v] -= min_val[cc[v]];
    for (int v = 1; v <= N; v++) {
        assert(val[v] >= 0);
        if (val[v] > (int)1e9) {
            cout << "No" << "\n";
            return 0;
        }
    }
    cout << "Yes\n";
}



Measured memory_bytes: 23040