#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <valarray>

#include<cassert>//assert();
//#include <random>//xAOJ
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
/////////

void solve(){
	int N,M;
	cin >> N >> M;
	vector< vector<int> > G(N,vector<int>(N,0));
	vector< vector<bool> > use(N,vector<bool>(N,false) );
	vector< int > line(N,0);
	vector< bool > post(N,false);
	int A,B,C;
	for(int i=0;i<M;++i){
		cin >> A >> B >> C;
		G[A][B] = C;
		++line[B];
	}
	vector<LD> ret(N,0.0);
	ret[0] = 1.0;
	queue<int> q;
	q.push(0);
	int id;
	
	while( !q.empty() ){
		id = q.front();
		q.pop();
		//配る番
		if( post[id] ) continue;
		if( line[id] ){
			q.push( id );
			continue;
		}
		post[id] = true;
		for(int i=0;i<N;++i){
			
			if( G[id][i] ){
				--line[i];
				q.push(i);
				if( ret[i] == 0){
					ret[i] = ret[id] * G[id][i]/100.0;
				}else{
					ret[i] = 1.0-(1-ret[i]) * (1-ret[id]*G[id][i]/100.0);
				}
			}
		}
	}
	cout << ret[N-1] << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}