#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#define LL long long
#define sint short int
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N=1005;
const double ex=1e-6;
const int INF=0x3f3f3f3f;
int head[N],I;
struct node
{int j,next;int c;
}edge[N*N];
bool visited[N];
int a[N],b[N];
double c[N];
void add(int i,int j,int c)
{edge[I].j=j;edge[I].c=c;edge[I].next=head[i];head[i]=I++;
}
bool equals(double x1,double x2)
{if(abs(x1-x2)<ex)return true;return false;
}
bool bfs(int l)
{queue<int>qt;stack<int>st;a[l]=0;b[l]=1;qt.push(l);st.push(l);visited[l]=true;double X;bool flag=false;while(!qt.empty()){int i=qt.front();qt.pop();for(int t=head[i];t!=-1;t=edge[t].next){int j=edge[t].j;if(!visited[j]){visited[j]=true;a[j]=edge[t].c-a[i];b[j]=-b[i];qt.push(j);st.push(j);}else{if(b[i]+b[j]==0){if(a[i]+a[j]!=edge[t].c){return false;}}else{double tmpx=1.0*(edge[t].c-(a[i]+a[j]))/(b[i]+b[j]);if(flag&&!equals(tmpx,X)){return false;}flag=true;X=tmpx;}}}}if(flag==false)return false;while(!st.empty()){int k=st.top();st.pop();c[k]=a[k]+X*b[k];}return true;
}
int main()
{//freopen("data.in","r",stdin);int n,m;while(cin>>n>>m){memset(head,-1,sizeof(head));I=0;while(m--){int l,r;int k;cin>>l>>r>>k;add(l,r,k);add(r,l,k);}memset(visited,false,sizeof(visited));int l;for(l=1;l<=n;++l){if(!visited[l]){if(!bfs(l))break;}}if(l<=n)cout<<"IMPOSSIBLE"<<endl;else{for(int i=1;i<=n;++i)printf("%.2lf\n",c[i]);}}return 0;
}