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>
using namespace std;
struct Edge {
  int to;
  int nxt;
  double len;
} e[400005];
int n, m, edgenum, w[200005], pos[200005], head[200005], pa[200005],
    size[200005], maxs[200005], cnt[200005], tmp[200005], top, root, ans;
double dis[200005], st[200005], sum[200005], tot;
bool flag[200005];
void add(int u, int v, double l) {
  e[++edgenum].len = l;
  e[edgenum].to = v;
  e[edgenum].nxt = head[u];
  head[u] = edgenum;
}
void dfs1(int node, int n) {
  size[node] = 1;
  maxs[node] = 0;
  for (int hd = head[node]; hd; hd = e[hd].nxt) {
    int to = e[hd].to;
    if (to == pa[node] || flag[to]) continue;
    pa[to] = node;
    dfs1(to, n);
    size[node] += size[to];
    maxs[node] = max(maxs[node], size[to]);
  }
  maxs[node] = max(maxs[node], n - size[node]);
  if (maxs[node] < maxs[root]) root = node;
}
void dfs2(int node) {
  st[++top] = dis[node];
  pos[top] = node;
  for (int hd = head[node]; hd; hd = e[hd].nxt) {
    int to = e[hd].to;
    if (to == pa[node]) continue;
    pa[to] = node;
    dis[to] = dis[node] + e[hd].len;
    dfs2(to);
  }
}
void check(int r) {
  pa[r] = 0;
  dis[r] = 0;
  top = 0;
  dfs2(r);
  double sum = 0;
  for (int i = 1; i <= top; i++) sum += sqrt(st[i]) * st[i] * w[pos[i]];
  if (sum < tot) tot = sum, ans = r;
}
void solve() {
  pa[root] = 0;
  dis[root] = 0;
  flag[root] = 1;
  int num = 0;
  for (int hd = head[root]; hd; hd = e[hd].nxt) {
    int to = e[hd].to;
    pa[to] = root;
    dis[to] = e[hd].len;
    top = 0;
    dfs2(to);
    num++;
    sum[num] = 0;
    for (int i = 1; i <= top; i++) sum[num] += sqrt(st[i]) * w[pos[i]];
    tmp[num] = to;
  }
  double s = 0;
  int x = 0;
  for (int i = 1; i <= num; i++) s += sum[i];
  for (int i = 1; i <= num; i++) {
    if (sum[i] > s - sum[i]) {
      x = tmp[i];
      break;
    }
  }
  if (!x) {
    check(root);
    return;
  }
  if (flag[x]) {
    check(root);
    check(x);
    return;
  }
  root = 0;
  dfs1(x, n);
  root = 0;
  dfs1(x, size[x]);
  solve();
}
int main() {
  tot = 1e18;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int u, v;
    double l;
    scanf("%d%d%lf", &u, &v, &l);
    add(u, v, l);
    add(v, u, l);
  }
  maxs[0] = 2147483647;
  dfs1(1, n);
  solve();
  printf("%d %.12lf\n", ans, tot);
  return 0;
}
