#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10;
int n,m;
int head[N<<1],cnt;
int u[N],v[N],w[N],id[N];
bool vis[N];
bool vise[N];
bool vis2[N];
int dfncnt,dfn[N],low[N];
int bridge[N<<1];
struct node
{
    int v,nxt,w,id;
}e[N<<1];
struct Node
{
    int u,dis;
    bool operator<(const Node &t)const{
        return dis<t.dis;
    }
};
int dis1[N],dis2[N];
int read()
{
    int x=0,f=1;char c=getchar();
    while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
void add(int u,int v,int w,int id)
{
    e[++cnt].v=v;
    e[cnt].w=w;
    e[cnt].id=id;
    e[cnt].nxt=head[u];
    head[u]=cnt;
}
void dij()  
{
    for(int i=1;i<=n;i++) dis1[i]=1e18;
    dis1[1]=0;
    priority_queue<Node> q;
    q.push({1,0});
    while(!q.empty())
    {
        Node u=q.top();
        q.pop();
        if(vis[u.u]==1) continue;
        vis[u.u]=1;
        for(int i=head[u.u];i;i=e[i].nxt)
        {
            int to=e[i].v;
            if(vis[to]==1) continue;
            if(dis1[to]>u.dis+e[i].w)
            {
                dis1[to]=u.dis+e[i].w;
                q.push({to,dis1[to]});
            }
        }
    }
    // for(int i=1;i<=m;i++)
    //     if(vise[i]==1) printf("%d ",i);
}
void dij2()  
{
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++) dis2[i]=1e18;
    dis2[n]=0;
    priority_queue<Node> q;
    q.push({n,0});
    while(!q.empty())
    {
        Node u=q.top();
        q.pop();
        if(vis[u.u]==1) continue;
        vis[u.u]=1;
        for(int i=head[u.u];i;i=e[i].nxt)
        {
            int to=e[i].v;
            if(vis[to]==1) continue;
            if(dis2[to]>u.dis+e[i].w)
            {
                dis2[to]=u.dis+e[i].w;
                q.push({to,dis2[to]});
            }
        }
    }
}
void qlc(int u,int fa)
{
    low[u]=dfn[u]=++dfncnt;
    for(int i=head[u];i;i=e[i].nxt)
    {
        int to=e[i].v;
        if(!dfn[to])
        {
            qlc(to,i);
            low[u]=min(low[u],low[to]);
            if(low[to]>dfn[u])
            {
                bridge[i]=bridge[i^1]=1;
            }
        }
        else if(i!=(fa^1))
            low[u]=min(low[u],dfn[to]);
    }
}
void dfs(int u,int fa)
{
    for(int i=head[u];i;i=e[i].nxt)
    {
        int to=e[i].v;
        if(to==fa) continue;
        if(bridge[i]==1) vis2[e[i].id]=1;
        dfs(to,u);
    }
}
signed main()
{
    n=read(),m=read();
    for(int i=1;i<=m;i++)
    {
        u[i]=read(),v[i]=read(),w[i]=read(),id[i]=i;
        add(u[i],v[i],w[i],id[i]);
        add(v[i],u[i],w[i],id[i]);
    }
    dij();
    dij2();
    for(int i=1;i<=m;i++)
    {
        if(dis1[u[i]]+w[i]+dis2[v[i]]==dis1[n])
            vise[i]=1;
        if(dis1[v[i]]+dis2[u[i]]+w[i]==dis1[n])
            vise[i]=1;
    }
    // for(int i=1;i<=m;i++)
    //     if(vise[i]==1) printf("%d ",i);
    memset(e,0,sizeof(e));
    memset(head,0,sizeof(head));
    cnt=1;
    for(int i=1;i<=m;i++)
    {
        if(vise[i]==1)
        {
            add(u[i],v[i],w[i],id[i]);
            add(v[i],u[i],w[i],id[i]);
        }
    }
    for(int i=1;i<=n;i++)
        if(!dfn[i])
            qlc(i,0);
    // printf("%d\n",cnt);
    dfs(1,0);
    for(int i=1;i<=m;i++)
    {
        if(vis2[id[i]]==0)
            printf("No\n");
        else printf("Yes\n");
    }   
    return 0;
}