// Slower C++ solution:
#include <iostream>

#include <vector>

using namespace std;

 

int n,m; //input intergers:n,m

vector<pair<int,int> > e[100010]; //the vector array of DFS

long long pos[100010]; //the positions of each person 

bool vis[100010]; //the bool array of DFS to know each person has visited or not

 

inline void dfs(int x) //DFS

{

	vis[x]=1; //visited this person(x)

	for(int i=0;i<e[x].size();i++) //visit the person who has relation of this person(x)

	{

		pair<int,int> cur=e[x][i];

		if(vis[cur.first]) //if(this person(e[x][i])'s position has known)

		{

			if(pos[cur.first]-pos[x]!=cur.second) {cout<<"No";exit(0);} //if this person(e[x][i]) is wrongful then exit

		}

		else //if this person(e[x][i])'s position hasn't known then take notes and DFS

		{

			pos[cur.first]=pos[x]+cur.second;

			dfs(cur.first);

		}

	}

}

 

int main()

{

	cin>>n>>m; //input

	for(int i=0;i<m;i++)

	{

		int l,r,d;

		cin>>l>>r>>d; //input

		e[l].push_back({r,d}); //take notes

		e[r].push_back({l,-d}); //take notes

	}

	

	for(int i=0;i<n;i++) if(!vis[i]) dfs(i); //DFS

	

	cout<<"Yes"; //if every one isn't wrongful then print 'Yes'

	

	return 0; //END

}

// Faster C++ solution for the same problem (measured speedup: 3.4589410871328967x):
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/trie_policy.hpp>

#include <ext/rope>



//#pragma 03

//#pragma GCC optimize("Ofast")

//#pragma GCC optimization("unroll-loops, no-stack-protector")

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2")



#define ll long long

#define ld long double

#define fi first

#define se second

#define sz(x) x.size()

#define mp make_pair

#define pb push_back

#define eb emplace_back

#define all(x) begin(x), end(x)

#define rall(x) rbegin(x), rend(x)

#define rep(i, x, n) for (ll i = x; i < n; i++)

#define fastio() ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0)

//#define int long long



using namespace std;

using namespace __gnu_pbds;

using namespace __gnu_cxx;



mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



typedef vector<int> vi;

typedef vector<vi> vvi;

typedef pair<int, int> ii;

typedef vector<pair<int, int> > vii;

typedef vector<ll> vl;

typedef vector<vl> vvl;

typedef pair<ll, ll> pll;

typedef vector<pll> vll;



inline void EXECUTE_TIME() {cout << endl << setprecision(10) << fixed << "CPU Time: " << clock() / double(CLOCKS_PER_SEC) << " sec(s)\n";}



template <class T> inline T RD(T &a) {T x; cin >> x; return a = x;}

template <class T> inline T gcd(T a, T b) {if (b) return gcd(b, a % b); else return a;}

template <class T> inline T lcm(T a, T b) {return a / gcd(a,b) * b;}

template<typename T> using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update> pref_trie;



const int N = 1e5 + 1;



vector<vii> adj;

bool check[N];

int dist[N];

bool FAIL;



void dfs(int u) {

    if (!check[u]) check[u] = true;

    for (ii v : adj[u]) {

        if (!check[v.fi]) {

            dist[v.fi] = dist[u] - v.se;

            dfs(v.fi);

        } else {

            if (dist[u] - v.second != dist[v.first]) FAIL = true;

        }

    }

}



signed main() {

//    freopen("connect.in", "r", stdin);

//    freopen("connect.out", "w", stdout);

    fastio();



    int n, m; cin >> n >> m;

    adj.assign(n, vii());



    int l, r, d;

    for (int i = 0; i < m; i++) {

        cin >> l >> r >> d; l--, r--;

        adj[l].pb({r, d});

        adj[r].pb({l, -d});

    }



    for (int i = 0; i < n; i++) {

        if (!check[i]) {

            dist[i] = 0;

            dfs(i);

        }

    }



    if (!FAIL) cout << "Yes";

    else cout << "No";



//    EXECUTE_TIME();

}