#include<vector>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cassert>
#include<array>
using namespace std;
using ll = long long;
#define xx first
#define yy second

const int MAXN=3001;
const int mod=1e9+7;

int n,m;
vector<pair<int,int>> adj[MAXN];
vector<array<int, 4>> par[MAXN];

int get_len(int x, int y) {
    int res=0;
    while(x!=par[x][y][0]) {
        array<int, 4> p=par[x][y];
        x=p[0];
        y=p[1];
        res++;
    }
    return res;
}

ll compare(int a, int b, int w1, int l1,  int x, int y, int w2, int l2) {
    ll bal=0;
    int i=l1, j=l2;
    while(i>0 || j>0) {
        array<int, 4> p1=par[a][b],
                      p2=par[x][y];
        if(i>j) {
            bal=(bal-w1)*2-p1[2];
            w1=0;
            a=p1[0];
            b=p1[1];
            i--;
        }else if(i<j) {
            bal=(bal+w2)*2+p2[2];
            w2=0;
            x=p2[0];
            y=p2[1];
            j--;
        }else {
            bal=(bal-w1+w2)*2-p1[2]+p2[2];
            w1=w2=0;
            a=p1[0];
            b=p1[1];
            x=p2[0];
            y=p2[1];
            i--;j--;
        }

        if(abs(bal)>(ll)2e9) {
            return bal;
        }
    }
    bal-=w1;bal+=w2;
    return bal;
}

int get_ans(int x, int y) {
    int res=0;
    while(x!=par[x][y][0]) {
        array<int, 4> p=par[x][y];
        res=(res*2%mod+p[2])%mod;
        x=p[0];
        y=p[1];
    }

    return res;
}

struct state {
    int x;
    int pa, pb, pw;
    int len;

    bool operator<(const state& masik) const {
        ll b=compare(pa, pb, pw, len, masik.pa, masik.pb, masik.pw, masik.len);
        if(b>0) return true;
        if(b<0) return false;
        return len<masik.len;
    }
    bool operator>(const state& masik) const {
        return !(*this<masik);
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=0;i<m;++i) {
        int a,b,c;
        cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }

    vector<int> ans(n+1, -1);
    priority_queue<state, vector<state>, greater<state>> pq;
    pq.push(state{1, 1, 0, 0, 0});
    while(!pq.empty()) {
        state curr=pq.top();
        pq.pop();
        //cerr<<curr.x<<" "<<curr.pa<<" "<<curr.pb<<" "<<curr.pw<<"\n";
        int x=curr.x;
        if(!par[x].empty() && par[x].back()[3]<=curr.len) continue ;
        
        par[x].push_back({curr.pa, curr.pb, curr.pw, curr.len});
        if(par[x].size()==1) {
            ans[x]=get_ans(x, 0);
        }
        
        for(auto i:adj[x]) {
            pq.push(state{i.xx, x, (int)par[x].size()-1, i.yy, curr.len+1});
        }
    }
    int sum=0;
    for(int i=2;i<=n;++i) {
        sum+=par[i].size();
        cout<<ans[i]<<"\n";
    }
    cerr<<double(sum)/n<<"\n";
}