#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int N, M;

vector<pair<int, double>> dag[30];

int main() {

  cin >> N >> M; 

  rep(i, M) {
    int a, b; double c;
    cin >> a >> b >> c; c /= 100;
    dag[a].emplace_back(b, c);
  }

  vector<double> inTarget;

  queue<pair<int, double>> q;
  q.emplace(0, 1.0);

  while(!q.empty()) {
    auto p = q.front(); q.pop();
    int curr = p.first;
    double prob = p.second;

    rep(i, dag[curr].size()) {
      int tar = dag[curr][i].first;
      double trans = dag[curr][i].second;
      if(tar == N-1) {
        inTarget.push_back(prob * trans);
      }
      else {
        q.emplace(tar, prob * trans);
      }
    }
  }

  int n = inTarget.size();
  double res = 0.0;
  REP(S, 1, 1<<n) {
    int sign = __builtin_popcount(S) % 2 ? 1 : -1;
    double sum = sign;
    rep(i, n) {
      if(S >> i & 1) {
        sum *= inTarget[i];
      }
    }
    res += sum;
  }

  printf("%.10f\n", res);

  return 0;
}