#include<iostream>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<cmath>
//#include<set>
//#include<vector>
#include<queue>
//#include<map>
//#include<string.h>
using namespace std;
int n,m;
const int maxn=10001;
struct edge{
int v,nxt,w;
}e[maxn<<1];
int p[maxn],eid=0;
int dist[maxn],cnt[maxn];
bool inq[maxn];
bool spfa(){//有付环,返回true
memset(inq,0,sizeof(inq));
memset(dist,0xbfbfbfbf,sizeof(dist));
memset(cnt,0,sizeof(cnt));
queue<int>q;
dist[0]=0;
q.push(0);
inq[0]=1;
cnt[0]++;
if(cnt[0] > n+1) {//有付环
return true;
}
while(!q.empty()){
int u=q.front();
q.pop();
inq[u]=false;
for(int i=p[u];i;i=e[i].nxt){
int v=e[i].v;
if(dist[u]+e[i].w>dist[v]){ //找最长路
dist[e[i].v]=dist[u]+e[i].w;
if(!inq[v]){
q.push(v);
inq[v]=true;
cnt[v]++;
}
if(cnt[v] > n + 1) {
return true;//有付环
}
}
}
}
return false;
}
inline void ins(int u,int v,int w){
e[++eid].v=v;e[eid].nxt=p[u];p[u]=eid;
e[eid].w=w;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int t;
scanf("%d",&t);
int a,b,c;
if(t==1){
scanf("%d%d%d",&a,&b,&c);//a - b >= c
//a - b >= c -> b +c <= a 转化为 b-->a 最长路
ins(b,a,c);
}
else if(t==2){
scanf("%d%d%d",&a,&b,&c);
//a-b<=c -> a+(-c)<=b 转化为 a-->b 最长路
ins(a,b,-c);
}
else{
scanf("%d%d",&a,&b);
//a<=b&&b<=a
ins(a,b,0);
ins(b,a,0);
}
}
for(int i=1;i<=n;i++)
ins(0,i,0); //插入超级源点
if( spfa()) printf("No");//有付环,则无解
else printf("Yes");
return 0;
}