#include<bits/stdc++.h>
using namespace std;
int n,m,head[5003],cnt,vis[5005],d[5000],t[5500];
struct edge
{
	int from,to,d;
}e[15000];
void add(int u,int v,int w)
{
	e[++cnt].from=head[u];
	e[cnt].to=v;
	e[cnt].d=w;
	head[u]=cnt;
}
queue<int>q;
void bfs()
{
	q.push(0);
	vis[0]=1;d[0]=0;
	while(!q.empty())
	{
		int u=q.front();q.pop();
		vis[u]=0;
		for(int i=head[u];i;i=e[i].from)
		{
			int v=e[i].to;
			if(d[u]+e[i].d<d[v])
			{
				d[v]=d[u]+e[i].to;
				if(vis[v]==0)
				{
					q.push(v);
					vis[v]=1;
					t[v]=t[u]+1;
					if(t[v]>=n+1)
					{
						cout<<"No";
						return ;
					}
				}
			}
		}
	}
	cout<<"Yes";
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("test.in","r",stdin);
	freopen("test.out","w",stdout);
#endif
	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int op,x,y,c;
		cin>>op>>x>>y;
		switch (op) {
		case 1://x>=y+c x-c>=y
			cin>>c;
			add(x,y,-c);
			break;
		case 2://x<=y+c x->y=c
			cin>>c;
			add(y,x,c);
			break;
		case 3://x==y
			add(x,y,0);
			add(y,x,0);
			break;
		}
	}
	for(int i=1;i<=n;i++)
		add(0,i,0);
	memset(d,63,sizeof(d));
	bfs();
	return 0;
}