import sys
from collections import deque

def main():
    N, M = map(int, sys.stdin.readline().split())
    in_edges = [[] for _ in range(N)]  # in_edges[B] contains list of (A, C)
    adj = [[] for _ in range(N)]       # adjacency list for topological sort (excluding edges to 0)
    in_degree = [0] * N

    for _ in range(M):
        A, B, C = map(int, sys.stdin.readline().split())
        in_edges[B].append((A, C))
        if B != 0:
            adj[A].append(B)
            in_degree[B] += 1

    # Topological sort starting from node 0
    order = []
    q = deque([0])
    order.append(0)

    while q:
        u = q.popleft()
        for v in adj[u]:
            in_degree[v] -= 1
            if in_degree[v] == 0:
                q.append(v)
                order.append(v)

    # Calculate probabilities
    prob = [0.0] * N
    prob[0] = 1.0

    for node in order[1:]:  # skip 0 as it's already processed
        product = 1.0
        for (a, c) in in_edges[node]:
            product *= (1.0 - prob[a] * (c / 100.0))
        prob[node] = 1.0 - product

    # Output with sufficient precision
    print("{0:.10f}".format(prob[N-1]))

if __name__ == "__main__":
    main()