3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
const int N = 2e5;
using namespace std;
struct edges {
  int to, cost;
} edge[N * 2 + 5];
int n, a[N + 5], nxt[N * 2 + 5], head[N + 5], edge_cnt, maxp[N + 5], rt,
    size[N + 5], sm, dis[N + 5], vis[N + 5], co[N + 5], id;
double ans;
void add_edge(int u, int v, int w) {
  edge[++edge_cnt] = (edges){v, w};
  nxt[edge_cnt] = head[u];
  head[u] = edge_cnt;
}
void dfs(int u, int fa) {
  size[u] = 1;
  maxp[u] = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = edge[i].to;
    if (vis[v] || v == fa) continue;
    dfs(v, u);
    size[u] += size[v];
    maxp[u] = max(maxp[u], size[v]);
  }
  maxp[u] = max(maxp[u], sm - size[u]);
  if (maxp[u] < maxp[rt]) rt = u;
}
void getdis(int u, int fa, int c) {
  co[u] = c;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = edge[i].to, w = edge[i].cost;
    if (v == fa) continue;
    dis[v] = dis[u] + w;
    getdis(v, u, c);
  }
}
int calc(int u) {
  dis[u] = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = edge[i].to, w = edge[i].cost;
    dis[v] = w;
    getdis(v, u, v);
  }
  double s = 0, mx = 0;
  int mxi = 0;
  for (int i = 1; i <= n; i++) {
    s += pow(dis[i], 1.5) * a[i];
    if (pow(dis[i], 1.5) * a[i] > mx) mx = pow(dis[i], 1.5) * a[i], mxi = i;
    mx = max(mx, pow(dis[i], 1.5) * a[i]);
  }
  if (ans == -1) ans = s, id = u;
  if (s < ans) ans = s, id = u;
  return co[mxi];
}
void solve(int u) {
  vis[u] = 1;
  int son = calc(u);
  if (vis[son] || !son) return;
  rt = 0;
  maxp[rt] = sm = size[son];
  dfs(son, 0);
  solve(rt);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int u, v, w;
  for (int i = 1; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    add_edge(u, v, w);
    add_edge(v, u, w);
  }
  maxp[rt] = sm = n;
  ans = -1;
  dfs(1, 0);
  solve(rt);
  printf("%d %.10lf", id, ans);
  return 0;
}
