/**************************************************************

    Problem: 3436

    User: yekehe

    Language: C++

    Result: Accepted

    Time:252 ms

    Memory:10916 kb

****************************************************************/

#include <cstdio>

#include <vector>

#include <cstring>

using namespace std;

char tc()

{

    static char fl[],*A=fl,*B=fl;

    return A==B&&(B=(A=fl)+fread(fl,,,stdin),A==B)?EOF:*A++;

}

int read()

{

    char c;while(c=getchar(),(c<'' || c>'') && c!='-');

    int x=,y=;c=='-'?y=-:x=c-'';

    while(c=getchar(),c>='' && c<='')x=x*+c-'';return x*y;

}

const int MAXN=;

int N,M;

int o,x,y,z;

int dist[MAXN],vis[MAXN];

bool flag;

vector < pair<int, int> > a[MAXN];

void cf_spfa(int x)

{

    int to,val;

        for(int i=;i<a[x].size();i++){

            to=a[x][i].first;val=a[x][i].second;

            if(dist[x]+val<dist[to]){

                if(vis[to]){

                    flag=true;

                    return ;

                }

                else {

                    dist[to]=dist[x]+val;

                    vis[to]=;

                    cf_spfa(to);

                }

            }

        }

    vis[x]=false;

}//SPFA判负环

int main()

{

//  freopen("x.txt","r",stdin);

    N=read(),M=read();

        for(int i=; i<=M; i++){

            o=read();

            if(o==) {x=read(),y=read(),z=read();a[y].push_back(make_pair(x,-z));}

            if(o==) {x=read(),y=read(),z=read();a[x].push_back(make_pair(y,z));}

            if(o==) {x=read(),y=read();a[x].push_back(make_pair(y,)),a[y].push_back(make_pair(x,));}

        }//建边

        for(int i=; i<=N; i++) {memset(dist,,sizeof(dist));cf_spfa(i);if(flag)break;}

    if(flag)puts("No");

    else puts("Yes");

    return ;

}