from collections import deque

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    N = int(data[idx])
    idx += 1
    M = int(data[idx])
    idx += 1
    
    outgoing = [[] for _ in range(N)]
    incoming = [[] for _ in range(N)]
    in_degree = [0] * N
    
    for _ in range(M):
        A = int(data[idx])
        idx += 1
        B = int(data[idx])
        idx += 1
        C = int(data[idx])
        idx += 1
        outgoing[A].append((B, C))
        incoming[B].append((A, C))
        in_degree[B] += 1
    
    # Kahn's algorithm for topological sort
    q = deque()
    for i in range(N):
        if in_degree[i] == 0:
            q.append(i)
    
    top_order = []
    while q:
        u = q.popleft()
        top_order.append(u)
        for (v, c) in outgoing[u]:
            in_degree[v] -= 1
            if in_degree[v] == 0:
                q.append(v)
    
    p = [0.0] * N
    p[0] = 1.0
    
    for j in top_order:
        for (i, c) in incoming[j]:
            prob = p[i] * (c / 100.0) * (1 - p[j])
            p[j] += prob
    
    print("{0:.10f}".format(p[N-1]))

if __name__ == "__main__":
    main()